Approximation Algorithms Design for Disk Partial Covering Problem.

Bin Xiao Jiannong Cao Qingfeng Zhuge Yi He Edwin Hsing-Mean Sha

Published in: ISPAN (2004)

Keyphrases

approximation algorithms
np hard
special case
worst case
vertex cover
network design problem
disjoint paths
dynamic programming
minimum cost
np hardness