Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs.
Marek KarpinskiRichard SchmiedClaus ViehmannPublished in: Electron. Colloquium Comput. Complex. (2011)
Keyphrases
- vertex cover
- approximation algorithms
- worst case
- upper bound
- lower bound
- polynomial time approximation
- np hard
- constant factor
- approximation ratio
- error bounds
- approximation guarantees
- minimum cost
- greedy algorithm
- special case
- upper and lower bounds
- planar graphs
- undirected graph
- optimal solution
- precedence constraints
- computational complexity
- partition function
- lower and upper bounds
- graph theory
- graph structure
- branch and bound algorithm
- pairwise