Approximation algorithms for intersection graphs
- We introduce three new complexity parameters that in some sense measure how chordal-like a graph is. The similarity to chordal graphs is used to construct simple polynomial-time approximation algorithms with constant approximation ratio for many NP-hard problems, when restricted to graphs for which at least one of our new complexity parameters is bounded by a constant. As applications we present approximation algorithms with constant approximation ratio for maximum weighted independent set, minimum (independent) dominating set, minimum vertex coloring, maximum weighted clique, and minimum clique partition for large classes of intersection graphs.
| Author: | Frank Kammer, Torsten Tholey, Heiko Voepel |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-10964 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/1303 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2009-06) |
| Type: | Report |
| Language: | English |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2009/09/02 |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
| Licence (German): |  Deutsches Urheberrecht |
