Approximation Algorithms for Edge-Dilation k-Center Problems.

Jochen Könemann Yanjun Li Ojas Parekh Amitabh Sinha

Published in: SWAT (2002)

Keyphrases

approximation algorithms
vertex cover
np hard
np hardness
disjoint paths
randomized algorithms
approximation schemes
special case
optimization problems
undirected graph
worst case
exact algorithms
minimum cost
approximation ratio
np complete
binary images