Login / Signup
On approximation of the vertex cover problem in hypergraphs.
Michael Okun
Published in:
Discret. Optim. (2005)
Keyphrases
</>
vertex cover
approximation algorithms
polynomial time approximation
np hard
approximation ratio
special case
precedence constraints
worst case
partial order
constant factor
planar graphs
error bounds
minimum cost
higher order
graph theory
undirected graph