Approximation algorithms design for disk partial covering problem

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn , Issue , 2004, Pages 104-109

  Xiao, Bin ^a   Cao, Jiannong ^a   Zhuge, Qingfeng ^b   He, Yi ^b   Sha, Edwin H M ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS; PROBLEM SOLVING; QUALITY OF SERVICE; REAL TIME SYSTEMS; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS; MOBILE NODES; MOBILE SERVERS;

SERVERS;

EID: 3543150210     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. P. K. Agarwal and C. M. Procopiuc, "Approximation algorithms for projective clustering," in Proceedings of 11th ACM-SIAM Sympos. Discrete Algorithms, pp. 538-547, 2000.
2. D. Johnson, "Approximation algorithms for combinatorial problems," Journal of Computing and Systems Sciences, vol. 9, pp. 256-278, 1974.
3. H. Bronninamm and M. Goodrich, "Almost optimal set covers in finite vcdimension," Discrete Computational Geometry, vol. 14, pp. 463-479, 1995.
4. Z. Drezner, "The p-center problem: heuristic and optimal algorithms," J. Oper. Res. Soc., vol. 35, pp. 741-748, 1984.
5. R. Z. Hwang, R. C. T. Lee, and R. C. Chang, "The slab dividing approach to solve the euclidean p-center problem," Algorithmica, vol. 9, pp. 1-22, 1993.
6. T. Gonzalez., "Clustering to minimize the maximum intercluster distance," Theoretical Computer Science, vol. 38, pp. 293-306, 1985.
7. T. Feder and D. Greene, "Optimal algorithms for approximate clustering," in Proceedings of the 20th Annual ACM Symposium on the Theory of Computing (STOC), pp. 434-444, 1988.
8. P. K. Agarwal and C. M. Procopiuc, "Exact and approximation algorithms for clustering (extended abstract)," in Proceedings of 9th ACM-SIAM Sympos. Discrete Algorithms, pp. 658-667, 1998.
9. T. Gonzalez., "Covering a set of points in multidimensional space," Information Processing Letters, vol. 40, pp. 181-188, 1991.
10. H. Huang, A. W. Richa, and M. Segal, "Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks," ACM Journal on Mobile Networks (MONET), pp. 52-61, 2002.
11. M. Franceschetti, M. Cook, and J. Bruck, "A geometric theorem for approximate disk covering algorithms," in http://www.paradise.caltech.edu/ ETR.html, 2001.
12. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan, "Algorithms for facility location problems with outliers," in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 642-651, 2001.
13. R. Gandhi, S. Khuller, and A. Srinivasan, "Approximation algorithms for partial covering problems," in Proceedings of the Twenty-Eighth International Colloquium on Automata, Languages, and Programming (ICALP), LNCS 2076, pp. 225-236, Jul. 2001.