Login / Signup
Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach.
H. Narayanan
Subir Roy
Sachin B. Patkar
Published in:
J. Algorithms (1996)
Keyphrases
</>
approximation algorithms
vertex cover
approximation schemes
np hardness
np hard
randomized algorithms
special case
minimum cost
np complete
network design problem
worst case
optimization problems
primal dual
upper bound
practical problems