Login / Signup
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
Noga Alon
Yossi Azar
János Csirik
Leah Epstein
Sergey V. Sevastianov
Arjen P. A. Vestjens
Gerhard J. Woeginger
Published in:
Algorithmica (1998)
Keyphrases
</>
approximation algorithms
vertex cover
np hard
approximation schemes
np hardness
exact algorithms
worst case
np complete
randomized algorithms
open shop
facility location problem
computational complexity
special case
minimum cost
network design problem
quadratic program