TY - GEN

T1 - Tractable Parameterizations for the Minimum Linear Arrangement Problem

AU - Fellows, Michael R.

AU - Hermelin, Dan

AU - Rosamond, Frances A.

AU - Shachnai, Hadas

PY - 2013/9/24

Y1 - 2013/9/24

N2 - 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 + ε)-approximation algorithm for MLA parameterized by (ε, 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.

AB - 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 + ε)-approximation algorithm for MLA parameterized by (ε, 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.

UR - http://www.scopus.com/inward/record.url?scp=84884335144&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/978-3-642-40450-4_39

DO - https://doi.org/10.1007/978-3-642-40450-4_39

M3 - منشور من مؤتمر

SN - 9783642404498

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 457

EP - 468

BT - Algorithms – ESA 2013

A2 - Bodlaender, Hans L.

A2 - Italiano, Giuseppe F.

PB - Springer

T2 - 21st Annual European Symposium on Algorithms, ESA 2013

Y2 - 2 September 2013 through 4 September 2013

ER -