A constant approximation algorithm for the densest k-subgraph problem on chordal graphs

Maria Liazi, Ioannis Milis, Vassilis Zissimopoulos
2008 Information Processing Letters  
The Densest k-Subgraph (DkS) problem asks for a k-vertex subgraph of a given graph with the maximum number of edges. The DkS problem is NP-hard even for special graph classes including bipartite, planar, comparability and chordal graphs, while no constant approximation algorithm is known for any of these classes. In this paper we present a 3-approximation algorithm for the class of chordal graphs. The analysis of our algorithm is based on a graph theoretic lemma of independent interest.
doi:10.1016/j.ipl.2008.03.016 fatcat:2f4e5ii5hba23kcakgbbhoxu3q