Approximation Algorithms for Intersection Graphs.
Frank KammerTorsten TholeyHeiko VoepelPublished in: APPROX-RANDOM (2010)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- vertex cover
- worst case
- approximation guarantees
- network design problem
- minimum cost
- primal dual
- facility location problem
- graph matching
- randomized algorithms
- np hardness
- approximation ratio
- disjoint paths
- constant factor
- set cover
- precedence constraints
- graph model
- approximation schemes
- directed graph
- bipartite graph
- polynomial time approximation
- open shop
- spanning tree