Tractable Parameterizations for the Minimum Linear Arrangement Problem

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

doi:10.1145/2898352

Tractable Parameterizations for the Minimum Linear Arrangement Problem

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

Department of Industrial Engineering and Management

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

The MINIMUM LINEAR ARRANGEMENT (MLA) problem involves embedding 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 graph. 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 obtain 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
Article number	6
Journal	ACM Transactions on Computation Theory
Volume	8
Issue number	2
DOIs	https://doi.org/10.1145/2898352
State	Published - 1 May 2016

Keywords

Fixed parameter tractability
MINIMUM LINEAR ARRANGEMENT
Parameterized algorithms

ASJC Scopus subject areas

Theoretical Computer Science
Computational Theory and Mathematics

Access to Document

10.1145/2898352

Cite this

@article{8741dbb26c3b409a9c16f515bb472385,

title = "Tractable Parameterizations for the Minimum Linear Arrangement Problem",

abstract = "The MINIMUM LINEAR ARRANGEMENT (MLA) problem involves embedding 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 graph. 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 obtain two FPT algorithms that exactly solve MLA parameterized by, respectively, the max leaf and edge clique cover numbers of the input graph.",

keywords = "Fixed parameter tractability, MINIMUM LINEAR ARRANGEMENT, Parameterized algorithms",

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

note = "Publisher Copyright: {\textcopyright} 2016 ACM.",

year = "2016",

month = may,

day = "1",

doi = "10.1145/2898352",

language = "English",

volume = "8",

journal = "ACM Transactions on Computation Theory",

issn = "1942-3454",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - Tractable Parameterizations for the Minimum Linear Arrangement Problem

AU - Fellows, Michael R.

AU - Hermelin, Danny

AU - Rosamond, Frances

AU - Shachnai, Hadas

PY - 2016/5/1

Y1 - 2016/5/1

N2 - The MINIMUM LINEAR ARRANGEMENT (MLA) problem involves embedding 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 graph. 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 obtain 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 involves embedding 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 graph. 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 obtain two FPT algorithms that exactly solve MLA parameterized by, respectively, the max leaf and edge clique cover numbers of the input graph.

KW - Fixed parameter tractability

KW - MINIMUM LINEAR ARRANGEMENT

KW - Parameterized algorithms

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

U2 - 10.1145/2898352

DO - 10.1145/2898352

M3 - Article

AN - SCOPUS:84969963442

SN - 1942-3454

VL - 8

JO - ACM Transactions on Computation Theory

JF - ACM Transactions on Computation Theory

IS - 2

M1 - 6

ER -

Tractable Parameterizations for the Minimum Linear Arrangement Problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this