Approximation Algorithms for Min-k-overlap Problems Using the Principal Lattice of Partitions Approach.

H. Narayanan Subir Roy Sachin B. Patkar

Published in: MFCS (1994)

Keyphrases

approximation algorithms
vertex cover
np hard
randomized algorithms
special case
np hardness
np complete
minimum cost
exact algorithms
set cover
primal dual
optimization problems
facility location problem
worst case
combinatorial optimization
network design problem
lower bound