Name
Abstract | ||
|---|---|---|
The Minimum Linear Arrangement (MLA) problem asks to embed a given graph on the integer line so that the sum of the edge lengths of the embedded graph is minimized. Most layout problems are either intractable, or not known to be tractable, parameterized by the treewidth of the input graphs. We investigate MLA with respect to three parameters that provide more structure than treewidth. In particular, we give a factor (1 + e)-approximation algorithm for MLA parameterized by (e, k), where k is the vertex cover number of the input graph. By a similar approach, we describe two FPT algorithms that exactly solve MLA parameterized by, respectively, the max leaf and edge clique cover numbers of the input graph. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2898352 | TOCT |
Keywords | Field | DocType |
Minimum linear arrangement,parameterized algorithms,fixed parameter tractability | Discrete mathematics,Combinatorics,Tree-depth,Partial k-tree,Edge cover,Clique cover,Vertex cover,Treewidth,Clique-width,1-planar graph,Mathematics | Conference |
Volume | Issue | ISSN |
8 | 2 | 1942-3454 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael R. Fellows | 1 | 4138 | 319.37 |
| Danny Hermelin | 2 | 790 | 48.62 |
| Frances A. Rosamond | 3 | 21 | 2.83 |
| Hadas Shachnai | 4 | 960 | 78.85 |