Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs.
Marek KarpinskiRichard SchmiedClaus ViehmannPublished in: J. Discrete Algorithms (2015)
Keyphrases
- vertex cover
- approximation algorithms
- worst case
- lower bound
- upper bound
- np hard
- polynomial time approximation
- error bounds
- constant factor
- approximation ratio
- approximation guarantees
- precedence constraints
- minimum cost
- special case
- branch and bound algorithm
- greedy algorithm
- partial order
- search algorithm
- lower and upper bounds
- optimal solution
- graph theory
- objective function
- greedy heuristic
- upper and lower bounds
- graph structure
- planar graphs
- state space