Login / Signup
Approximation algorithms that take advice.
Sanjeev Arora
Published in:
APPROX (2000)
Keyphrases
</>
approximation algorithms
np hard
special case
worst case
vertex cover
minimum cost
facility location problem
network design problem
exact algorithms
set cover
primal dual
np hardness
approximation ratio
constant factor
undirected graph
randomized algorithms
open shop
network design
scheduling problem