Approximation Algorithms for Intersection Graphs.
Frank KammerTorsten TholeyPublished in: Algorithmica (2014)
Keyphrases
- approximation algorithms
- undirected graph
- special case
- np hard
- worst case
- facility location problem
- vertex cover
- open shop
- primal dual
- graph matching
- np hardness
- minimum cost
- randomized algorithms
- network design problem
- set cover
- approximation schemes
- constant factor
- approximation guarantees
- approximation ratio
- disjoint paths
- graph structure
- precedence constraints
- weighted graph
- bipartite graph
- constraint satisfaction problems
- optimal solution