Approximation algorithms for intersection graphs

Authors:
Frank Kammer;Torsten Tholey;Heiko Voepel
Affiliations:
Institut für Informatik, Universität Augsburg, Augsburg, Germany;Institut für Informatik, Universität Augsburg, Augsburg, Germany;Institut für Informatik, Universität Augsburg, Augsburg, Germany
Venue:
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Year:
2010

Citing 16
Cited 3

A strongly polynomial algorithm to solve combinatorial linear programs

Operations Research
The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
Unit disk graphs

Discrete Mathematics - Topics on domination
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Tolerance intersection graphs on binary trees with constant tolerance

Discrete Mathematics
Polynomial-time approximation schemes for geometric graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for packing and piercing fat objects

Journal of Algorithms
Scheduling Split Intervals

SIAM Journal on Computing
Optimization problems in multiple-interval graphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation schemes for wireless networks

ACM Transactions on Algorithms (TALG)
Data reduction and exact algorithms for clique cover

Journal of Experimental Algorithmics (JEA)
Approximating minimum independent dominating sets in wireless networks

Information Processing Letters
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
Domination in geometric intersection graphs

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A weakly robust PTAS for minimum clique partition in unit disk graphs

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory

Algorithms for dominating set in disk graphs: breaking the log n Barrier

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Switchboard: a matchmaking system for multiplayer mobile games

MobiSys '11 Proceedings of the 9th international conference on Mobile systems, applications, and services
The maximum clique problem in multiple interval graphs (extended abstract)

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study three 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 the three 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.