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

Authors:
Maria Liazi;Ioannis Milis;Vassilis Zissimopoulos
Affiliations:
Department of Informatics and Telecommunications, University of Athens, 157 84 Athens, Greece;Department of Informatics, Athens University of Economics and Business, 104 34 Athens, Greece;Department of Informatics and Telecommunications, University of Athens, 157 84 Athens, Greece
Venue:
Information Processing Letters
Year:
2008

Citing 7
Cited 6

Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
k-edge subgraph problems

Discrete Applied Mathematics
Greedily finding a dense subgraph

Journal of Algorithms
On the densest k-subgraph problems

On the densest k-subgraph problems
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for maximum dispersion

Operations Research Letters
The quadratic 0-1 knapsack problem with series-parallel support

Operations Research Letters

Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs

Information Processing Letters
Densest k-subgraph approximation on intersection graphs

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
PTAS for densest k-subgraph in interval graphs

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A polyhedral study of the maximum edge subgraph problem

Discrete Applied Mathematics
Truncated power method for sparse eigenvalue problems

The Journal of Machine Learning Research
On the k-edge-incident subgraph problem and its variants

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.