• DOI:10.1007/978-3-642-18318-8_8
• Corpus ID: 11286135

Densest k-Subgraph Approximation on Intersection Graphs

@inproceedings{Chen2010DensestKA,
  title={Densest k-Subgraph Approximation on Intersection Graphs},
  author={Danny Ziyi Chen and Rudolf Fleischer and J. Li},
  booktitle={WAOA},
  year={2010}
}

• D. Chen, R. Fleischer, J. Li
• Published in WAOA 9 September 2010
• Mathematics

We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of σ-quasi elimination orders, introduced by Akcoglu et al. [1], generalizing the perfect elimination orders for chordal graphs, and develop a simple O(σ)-approximation technique for graphs admitting such a vertex order. This concept allows us to derive constant factor approximation algorithms for DS-k on many intersection graph classes, such as chordal graphs, circular-arc graphs, claw-free graphs, line graphs of l-hypergraphs, disk graphs, and the intersection graphs of fat geometric objects. We also present a PTAS for DS-k on unit disk graphs using the shifting technique.