Author:
Quilliot Alain,Rebaine Djamal,Toussaint Hélène
Abstract
We deal here with theLinear Arrangement Problem(LAP) onintervalgraphs, any interval graph being given here together with its representation as theintersectiongraph of some collection of intervals, and so with relatedprecedenceandinclusionrelations. We first propose a lower boundLB, which happens to be tight in the case ofunit intervalgraphs. Next, we introduce the restriction PCLAP of LAP which is obtained by requiring any feasible solution of LAP to be consistent with theprecedencerelation, 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 onintervalgraphs.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference32 articles.
1. A polynomial algorithm for minDSC on a subclass of series Parallel graphs
2. Ailon N., Charikar M. and Newman A., Aggregating inconsistent information: ranking and clustering. Proc. of 37th ACM Symp. Theory Comput. (STOC) (2005) 684–693.
3. Berge C., Graphes et Hypergraphes. Dunod Ed, Paris (1974).
4. On the cut polytope
5. Lower Bounds for the Minimum Linear Arrangement of a Graph