Sign in
Understanding discrete visibility and related approximation algorithms.
Subir Kumar Ghosh
Joel W. Burdick
Published in:
CCCG (1997)
Keyphrases
</>
approximation algorithms
np hard
vertex cover
special case
worst case
minimum cost
randomized algorithms
primal dual
exact algorithms
approximation ratio
disjoint paths
open shop
approximation schemes
set cover
np hardness
precedence constraints
genetic algorithm
network design problem