100 search results - page 1 / 20 » Approximation Algorithms for Geometric Intersection Graphs |
WG
2007
Springer
13 years 12 months ago
2007
Springer
WAOA
2010
Springer
13 years 3 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 ...
WADS
2007
Springer
13 years 12 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
WG
2004
Springer
13 years 11 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
ISAAC
2009
Springer
14 years 9 days ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...