Optimal Linear Arrangement of Interval Graphs
- Cite this paper as:
- Cohen J., Fomin F., Heggernes P., Kratsch D., Kucherov G. (2006) Optimal Linear Arrangement of Interval Graphs. In: Královič R., Urzyczyn P. (eds) Mathematical Foundations of Computer Science 2006. MFCS 2006. Lecture Notes in Computer Science, vol 4162. Springer, Berlin, Heidelberg
We study the optimal linear arrangement (OLA) problem on interval graphs. Several linear layout problems that are NP-hard on general graphs are solvable in polynomial time on interval graphs. We prove that, quite surprisingly, optimal linear arrangement of interval graphs is NP-hard. The same result holds for permutation graphs. We present a lower bound and a simple and fast 2-approximation algorithm based on any interval model of the input graph.
Unable to display preview. Download preview PDF.