Volume 52, Number 4-5, October–December 2018
|Page(s)||1123 - 1145|
|Published online||22 November 2018|
Lower and upper bounds for the linear arrangement problem on interval graphs
LIMOS, UMR CNRS 6158, LABEX IMOBS3, Université Blaise Pascal,
2 Département d’Informatique et de Mathématique, Université du Québec à Chicoutimi, Saguenay, QC G7H 2B1, Canada.
* Corresponding author: firstname.lastname@example.org
Accepted: 2 March 2017
We deal here with the Linear Arrangement Problem (LAP) on interval graphs, any interval graph being given here together with its representation as the intersection graph of some collection of intervals, and so with related precedence and inclusion relations. We first propose a lower bound LB, which happens to be tight in the case of unit interval graphs. Next, we introduce the restriction PCLAP of LAP which is obtained by requiring any feasible solution of LAP to be consistent with the precedence relation, and prove that PCLAP can be solved in polynomial time. Finally, we show both theoretically and experimentally that PCLAP solutions are a good approximation for LAP on interval graphs.
Mathematics Subject Classification: 90C27
Key words: Interval Graphs / Linear Ordering
© EDP Sciences, ROADEF, SMAI 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.