Tractable parameterizations for the minimum linear arrangement problem

Michael R. Fellows; Danny Hermelin; Frances A. Rosamond; Hadas Shachnai

doi:10.1007/978-3-642-40450-4_39

Tractable parameterizations for the minimum linear arrangement problem

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai

Department of Industrial Engineering and Management

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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 + ε)-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.

Original language	English
Title of host publication	Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings
Pages	457-468
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-40450-4_39
State	Published - 24 Sep 2013
Event	21st Annual European Symposium on Algorithms, ESA 2013 - Sophia Antipolis, France Duration: 2 Sep 2013 → 4 Sep 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8125 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st Annual European Symposium on Algorithms, ESA 2013
Country/Territory	France
City	Sophia Antipolis
Period	2/09/13 → 4/09/13

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-40450-4_39

Cite this

Fellows, M. R., Hermelin, D., Rosamond, F. A., & Shachnai, H. (2013). Tractable parameterizations for the minimum linear arrangement problem. In Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings (pp. 457-468). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8125 LNCS). https://doi.org/10.1007/978-3-642-40450-4_39

@inproceedings{b8e87c66e0a94981a1a5c9c2ed9d9364,

title = "Tractable parameterizations for the minimum linear arrangement problem",

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 + ε)-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.",

author = "Fellows, {Michael R.} and Danny Hermelin and Rosamond, {Frances A.} and Hadas Shachnai",

year = "2013",

month = sep,

day = "24",

doi = "10.1007/978-3-642-40450-4_39",

language = "English",

isbn = "9783642404498",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "457--468",

booktitle = "Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings",

note = "21st Annual European Symposium on Algorithms, ESA 2013 ; Conference date: 02-09-2013 Through 04-09-2013",

}

Fellows, MR, Hermelin, D, Rosamond, FA & Shachnai, H 2013, Tractable parameterizations for the minimum linear arrangement problem. in Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8125 LNCS, pp. 457-468, 21st Annual European Symposium on Algorithms, ESA 2013, Sophia Antipolis, France, 2/09/13. https://doi.org/10.1007/978-3-642-40450-4_39

Tractable parameterizations for the minimum linear arrangement problem. / Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A. et al.
Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. 2013. p. 457-468 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8125 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Tractable parameterizations for the minimum linear arrangement problem

AU - Fellows, Michael R.

AU - Hermelin, Danny

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 - 10.1007/978-3-642-40450-4_39

DO - 10.1007/978-3-642-40450-4_39

M3 - Conference contribution

AN - SCOPUS:84884335144

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 - 21st Annual European Symposium, Proceedings

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

Y2 - 2 September 2013 through 4 September 2013

ER -

Fellows MR, Hermelin D, Rosamond FA, Shachnai H. Tractable parameterizations for the minimum linear arrangement problem. In Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. 2013. p. 457-468. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-40450-4_39

Tractable parameterizations for the minimum linear arrangement problem

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this