Lower and upper bounds for the linear arrangement problem on interval graphs

Alain Quilliot (1) , Djamal Rebaine (2) , Hélène Toussaint (3)

1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
2 DIM - Département d'Informatique et de Mathématiques
3 LIMOS - Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes

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.

Domains: Operations Research [math.OC]

Alain Quilliot, Djamal Rebaine, Hélène Toussaint. Lower and upper bounds for the linear arrangement problem on interval graphs. RAIRO - Operations Research, 2018, 52 (4-5), pp.1123-1145. ⟨10.1051/ro/2017011⟩. ⟨hal-02024842⟩