Tractable Parameterizations for the Minimum Linear Arrangement Problem

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish GB
Title of host publicationAlgorithms – ESA 2013
Subtitle of host publication21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings
EditorsHans L. Bodlaender, Giuseppe F. Italiano
PublisherSpringer
Pages457-468
Number of pages12
DOIs
StatePublished - 24 Sep 2013
Event21st Annual European Symposium on Algorithms, ESA 2013 - Sophia Antipolis, France
Duration: 2 Sep 20134 Sep 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Volume8125
ISSN (Print)0302-9743

Conference

Conference21st Annual European Symposium on Algorithms, ESA 2013
Country/TerritoryFrance
CitySophia Antipolis
Period2/09/134/09/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Tractable Parameterizations for the Minimum Linear Arrangement Problem'. Together they form a unique fingerprint.

Cite this