Facility Location in sublinear time

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 866-877

  Bǎdoiu, Mihai ^a   Czumaj, Artur ^b   Indyk, Piotr ^a   Sohler, Christian ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b University Heights   (United States)

^c UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING;

BIOCHROMATIC MATCHING; METRIC SPACE POINTS; SUBLINEAR TIME;

COMPUTER SCIENCE;

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

References (14)

1. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 378-388, 1999.
2. B. Chazelle, R. Rubinfeld, and L. Trevisan. Approximating the minimum spanning tree weight in sublinear time. Proceedings of the 28th Annual International Colloquium on Automata, Languages and Programming (ICALP), pp. 190-200, 2001.
3. F. A. Chudak. Improved approximation algorithms for uncapacitated facility location. Proceedings of the 6th International Integer Programming and Combinatorial Optimization Conference (IPCO), pp. 180-194, 1998.
4. A. Czumaj and C. Sohler. Estimating the weight of metric minimum spanning trees in sublinear time. Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 175-183, 2004.
5. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31(1): 228-248, 1999.
6. P. Indyk. Sublinear time algorithms for metric space problems. Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 428-434, 1999.
7. P. Indyk. A sublinear time approximation scheme for clustering in metric spaces. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 154-159, 1999.
8. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 731-740, 2002.
9. K. Jain and V. Vazirani. Approximaton algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM, 48(2): 274-296, 2001.
10. M. Mahdian, Y. Ye, and J. Zhang. Improved approximation algorithms for metric facility location problems. Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization(APPROX), pp. 229-242, 2002.
11. C. McDiarmid. Concentration. In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, Algorithms and Combinatorics, pp. 195-247. Springer-Verlag, Berlin, 1998.
12. R. R. Mettu and C. G. Plaxton. The online median problem. SIAM Journal on Computing, 32(3): 816-832, 2003.
13. D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 265-274, 1997.
14. M. Thorup. Quick k-median, k-center, and facility location for sparse graphs. SIAM Journal on Computing, 34(2):405-432, 2005.