Approximation algorithms for geometric intersection graphs

Authors:
Klaus Jansen
Affiliations:
Institut für Informatik, Universität zu Kiel, Kiel, Germany
Venue:
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Year:
2007

Citing 9
Cited 0

Unit disk graphs

Discrete Mathematics - Topics on domination
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Label placement by maximum independent set in rectangles

WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Polynomial time approximation schemes for dense instances of NP -hard problems

Journal of Computer and System Sciences
Representing graphs by disks and balls (a survey of recognition-complexity results)

Discrete Mathematics
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs

SIAM Journal on Computing
Note: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe together with an overview about other results the main ideas of our polynomial time approximation schemes for the maximum weight independent set problem (selecting a set of disjoint disks in the plane of maximum total weight) in disk graphs and for the maximum bisection problem (finding a partition of the vertex set into two subsets of equal cardinality with maximum number of edges between the subsets) in unit-disk graphs.