Back to Results
First PageMeta Content
NP-complete problems / Vertex cover / Tree decomposition / Graph / Voltage graph / Dominating set / Graph theory / Theoretical computer science / Mathematics


Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1
Add to Reading List

Document Date: 2013-06-22 19:48:39

Open Document

File Size: 516,81 KB

Share Result on Facebook

City

Beer-Sheva / Haifa / Darwin / /

Company

H. / Vertex / /

Country

Australia / Israel / /

/

Event

Reorganization / /

Facility

Ben-Gurion University / Charles Darwin University / /

IndustryTerm

bounded search tree / exponential-time algorithms / typical applications / approximation algorithm / approximate solution / approximation algorithms / /

Organization

School of Engineering / Ben-Gurion University / Department of Industrial Engineering and Management / Charles Darwin University / Computer Science Department / Technion / /

Person

Richa / Rao / Karloff / /

Product

Pentax K-x Digital Camera / /

Technology

FPT algorithm / exponential-time algorithms / FPT algorithms / bounded search tree FPT algorithms / two FPT algorithms / approximation algorithm / time algorithm / approximation algorithms / 9 Algorithm / 3 Algorithm / G. Our algorithm / /

SocialTag