1 search results - page 1 / 1 » PTAS for Densest k-Subgraph in Interval Graphs |
WAOA
2010
Springer
13 years 2 months ago
2010
Springer
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 ...