k-Center problems with minimum coverage
暂无分享,去创建一个
Andrew Lim | Fan Wang | Brian Rodrigues | Zhou Xu | A. Lim | B. Rodrigues | Zhou Xu | Fan Wang
[1] George L. Nemhauser,et al. Easy and hard bottleneck location problems , 1979, Discret. Appl. Math..
[2] R. Ravi,et al. The p-Neighbor k-Center Problem , 1998, Inf. Process. Lett..
[3] Ján Plesník,et al. A heuristic for the p-center problems in graphs , 1987, Discret. Appl. Math..
[4] A. Frieze,et al. A simple heuristic for the p-centre problem , 1985 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Samir Khuller,et al. Fault tolerant K-center problems , 1997, Theor. Comput. Sci..
[7] Sven Oliver Krumke,et al. On a Generalization of the p-Center Problem , 1995, Inf. Process. Lett..
[8] David B. Shmoys,et al. A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..
[9] David B. Shmoys,et al. A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.
[10] Samir Khuller,et al. Fault tolerant K-center problems , 2000, Theor. Comput. Sci..
[11] Judit Bar-Ilan,et al. How to Allocate Network Centers , 1993, J. Algorithms.
[12] Samir Khuller,et al. The Capacitated K-Center Problem , 2000, SIAM J. Discret. Math..