Login / Signup
Efficient subspace approximation algorithms.
Nariankadu D. Shyamalkumar
Kasturi R. Varadarajan
Published in:
SODA (2007)
Keyphrases
</>
approximation algorithms
special case
np hard
worst case
vertex cover
minimum cost
primal dual
set cover
np hardness
low dimensional
exact algorithms
precedence constraints
network design problem
facility location problem
approximation schemes
disjoint paths