# Approximation Algorithms for Intersection Graphs

@article{Kammer2012ApproximationAF,
title={Approximation Algorithms for Intersection Graphs},
author={Frank Kammer and Torsten Tholey and Heiko Voepel},
journal={Algorithmica},
year={2012},
volume={68},
pages={312-336}
}
• Published 1 September 2010
• Mathematics
• Algorithmica
We study three complexity parameters that, for each vertex v, are an upper bound for the number of cliques that are sufficient to cover a subset S(v) of its neighbors. We call a graph k-perfectly groupable if S(v) consists of all neighbors, k-simplicial if S(v) consists of the neighbors with a higher number after assigning distinct numbers to all vertices, and k-perfectly orientable if S(v) consists of the endpoints of all outgoing edges from v for an orientation of all edges. These parameters…
26 Citations

### Approximation and Online Algorithms

• Mathematics, Computer Science
Lecture Notes in Computer Science
• 2015
This work considers the problem of finding d-regular spanning subgraphs of minimum weight with connectivity requirements and presents approximation algorithms that achieve constant approximation ratios for all d ≥ 2 · k/2 .

### Avoidable Vertices and Edges in Graphs

• Mathematics
• 2019
A polynomial-time algorithm for the maximum weight clique problem in a class of graphs generalizing the class of 1-perfectly orientable graphs and its subclasses chordal graphs and circular-arc graphs is derived using Lexicographic Breadth First Search and bisimplicial elimination orderings.

### Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier - (Extended Abstract)

• Mathematics, Computer Science
ESA
• 2010
A randomized algorithm is given that obtains a dominating set whose weight is within a factor 2O(log* n) of a minimum cost solution, with high probability - the technique follows the framework proposed recently by Varadarajan.

### Algorithms for Intersection Graphs of 𝑡 -Intervals and 𝑡 -Pseudodisks

• Mathematics, Computer Science
• 2022
The results are obtained via simple reductions to existing algorithms by appropriately bounding the union complexity of the objects under consideration, and it is shown that it is NP -hard to obtain a polynomial-time approximation ratio for dominating set in the intersection graph of 𝑡 -pseudodisks.

### Algorithms and Bounds for Very Strong Rainbow Coloring

• Mathematics
LATIN
• 2018
It is natural to prove that a coloring exists where, for every shortest path between every pair of vertices in the graph, all edges of the path receive different colors.

### Co-Bipartite Neighborhood Edge Elimination Orderings

• Mathematics, Computer Science
Electron. Notes Discret. Math.
• 2017

### Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks

• Mathematics, Computer Science
ArXiv
• 2019
For the minimum weight dominating set problem, a simple $O(t \log t)$ approximation is given for Multiple-Interval Graphs, improving on the previously known bound of $t^2$ and it is shown that it is NP-hard to obtain an $o(t)$-approximation in this case.

### On the structure of 1-perfectly orientable graphs

• Mathematics
ArXiv
• 2014
We study the class of 1-perfectly orientable (1-p.o.) graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-p.o. graphs form a common generalization of

### An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs

• Mathematics
ArXiv
• 2016
This work studies a simple subclass of chordal graphs, namely 2-trees and proves Hadwiger’s Conjecture for the square of the same, and shows the following stronger result: If G is thesquare of a 2-tree, then G has a clique minor of size χ(G), where each branch set is a path.

## References

SHOWING 1-10 OF 58 REFERENCES

### Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

• Mathematics, Computer Science
SIAM J. Comput.
• 2005
These are the first known PTASs for $\mathcal{NP}$-hard optimization problems on disk graphs based on a novel recursive subdivision of the plane that allows applying a shifting strategy on different levels simultaneously, so that a dynamic programming approach becomes feasible.

### Polynomial-time approximation schemes for geometric graphs

• Mathematics, Computer Science
SODA '01
• 2001
These are the first known polynomial-time approximation schemes for NP-hard optimization problems on disk graphs based on a novel recursive subdivision of the plane that allows applying a shifting strategy on different levels simultaneously, so that a dynamic programming approach becomes feasible.

### Domination in Geometric Intersection Graphs

• Mathematics, Computer Science
LATIN
• 2008
It is shown that for intersection graphs of arbitrary fat objects, the dominating set problem is as hard to approximate as for general graphs, and a new general technique for deriving approximation algorithms for various geometric intersection graphs is presented.

### Extremal Values of the Interval Number of a Graph

• Mathematics
SIAM J. Algebraic Discret. Methods
• 1980
It is proved here that for any graph G with maximum degree d, i ( G )\leqq \lceil \frac{1}{2} ( d + 1 ) \rceil \$ is best possible.

### A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs

• Computer Science
Algorithmica
• 2011
A weakly robust polynomial time approximation scheme (PTAS) for UDGs expressed with edge-lengths that admits a (2+ε)-approximation algorithm for the weighted case where the graph is expressed, say, as an adjacency matrix.

### Optimization problems in multiple-interval graphs

• Mathematics
SODA '07
• 2007
It is proved that MAXIMUM CLIQUE is NP-complete for the case of t = 3, and a (t2--t+1)/2-approximation algorithm for the problem is provided, using recent bounds proven for the so-called transversal number of t-interval families.

### Minimum Clique Partition in Unit Disk Graphs

• Computer Science, Mathematics
Graphs Comb.
• 2011
Two improved approximation algorithms for MCP in UDGs with a realization of a polynomial time approximation scheme and a randomized quadratic-time algorithm.

### Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier - (Extended Abstract)

• Mathematics, Computer Science
ESA
• 2010
A randomized algorithm is given that obtains a dominating set whose weight is within a factor 2O(log* n) of a minimum cost solution, with high probability - the technique follows the framework proposed recently by Varadarajan.

### Algorithmic aspects of intersection graphs and representation hypergraphs

A number of topics in algorithmic combinatorics which involve intersection graphs and their representative families of sets are presented and possible new directions of research are suggested.