A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
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
Selected papers from the second Krakow conference on Graph theory
Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Dynamic data structures for fat objects and their applications
Computational Geometry: Theory and Applications
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
Journal of Global Optimization
Greedily Finding a Dense Subgraph
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Finding Dense Subgraphs with Semidefinite Programming
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
On the densest k-subgraph problems
On the densest k-subgraph problems
Algorithmic aspects of constrained unit disk graphs
Algorithmic aspects of constrained unit disk graphs
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
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
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
Information Processing Letters
Finding Dense Subgraphs with Size Bounds
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
PTAS for densest k-subgraph in interval graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Secondary spectrum auctions for symmetric and submodular bidders
Proceedings of the 13th ACM Conference on Electronic Commerce
On the k-edge-incident subgraph problem and its variants
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.