M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. 31st STOC, pp. 1--10, 1999. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. 12th SODA, pp. 642--651, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Lagrangian Relaxation for the K-Median Problem: - New Insights And Self-citation (Shmoys) (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, & D.B. Shmoys. A constant-factor approximation algorithm for the k-median problem. 31st STOC, 1--10, 1999.
Clustering Data Streams: Theory and Practice - Guha, Meyerson, Mishra.. (2003) (3 citations) Self-citation (Guha) (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant factor approximation algorithm for the k-median problem. Proc. STOC, 1999.
Sublinear-Time Approximation for Clustering via - Random Sampling Artur (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. 31st STOC, pp. 1--10, 1999. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. 12th SODA, pp. 642--651, 2001.
The Effectiveness of Lloyd-Type Methods for the k-Means.. - Rafail Ostrovsky Rafail (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. J. Comput. and Syst. Sci., 65:129--149, 2002.
The Effects of Server Placement and Server Selection - For Internet Services (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. "A constant-factor approximation algorithm for the k-median problem". ACM Symposium on Theory of Computing, 1999.
Machine Learning, 56, 9--33, 2004 - Clustering Large Graphs (Correct)
No context found.
Charikar, M., Guha, S., Shmoys, D., & Tardos, E. (2002). A constant factor approximation algorithm for the k-median problem. Journal of Computer and System Sciences, 65:1, 129--149.
On the Optimization of Storage Capacity Allocation .. - Laoutaris.. (2003) (Correct)
No context found.
Charikar, M., Guha, S., Shmoys, D.B., Tardos, E.: A constant factor approximation algorithm for the k-median problem. In: Proceedings of the 31st Annual Symposium on the Theory of Computing (ACM STOC). (1999)
Polynomial Time Approximation Schemes for Geometric k-Clustering - Ostrovsky, Rabani (2001) (10 citations) (Correct)
No context found.
M. Charikar, S. Guha, D.B. Shmoys, and E. Tardos. A constant factor approximation algorithm for the k-median problem. In Proc. STOC '99.
An Algorithm for the 2-Median Problem on Two-Dimensional Meshes - Lau Cheng Tse (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. Shmoys. "A constant-factor approximation algorithm for the k-median problem", Proc. of the 3e Annual ACM Symposium on the Theory of Computing, 1999, 1--10.
A nearly linear-time approximation scheme for the Euclidean.. - Kolliopoulos, Rao (1999) (141 citations) (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. Shmoys. A constant factor approximation algorithm for the k-median problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 1-10, 1999.
Nash Equilibria in Competitive Societies, with Applications to.. - Vetta (2002) (4 citations) (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos and D. Shmoys, \A constant-factor approximation algorithm for the k-median problem", Proceedings of the 31 Annual Symposium on the Theory of Computing, pp1-10, 1999.
Distributed, Self-Stabilizing Placement of Replicated.. - Ko, Rubenstein (2003) (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem (extended abstract). In ACM Symposium on Theory of Computing (STOC), pages 1--10, Atlanta, GA, May 1999.
Faster Algorithms for k-Medians in Trees - Exte Nd Ed (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. Shmoys. A constant-factor approximation algorithm for the k-median problem. In Proc. 31st Annual ACM Symposium on Theory of Computing (STOC'99), pages 1-10, 1999.
Coresets for k-Means and k-Median Clustering and their.. - Har-Peled, Mazumdar (2003) (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. In Proc. 31st Annu. ACM Sympos. Theory Comput., pages 1-10, 1999.
Polynomial Time Approximation Schemes for Metric.. - Vega, Karpinski.. (2002) (2 citations) (Correct)
No context found.
M. Charikar, S. Guha, D.B. Shmoys, and E. Tardos. A constant factor approximation algorithm for the k-median problem. In Proc. of the 31st Ann. ACM Symp. on Theory of Computing, 1999.
Appendix A - Experimental Details This (Correct)
No context found.
Charikar, M., Guha, S., Tardos, E., and Shmoys, D. B. A constant-factor approximation algorithm for the k-median problem (extended abstract). In ACM Symposium on Theory of Computing (1999), pp. 1-10.
Unknown - Madhukar Korupolu Placement (Correct)
No context found.
M. Charikar, S. Guha, D. Shmoys, and ' E. Tardos. A constant-factor approximation algorithm for the k-median problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 1--10, May 1999.
Adaptive Beacon Placement - Bulusu, Heidemann, Estrin (2001) (28 citations) (Correct)
No context found.
Moses Charikar, Sudipto Guha, David Shmoys, and Eva Tardos. A constant-factor approximation algorithm for the k median problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 1-10, May 1999.
Approximation Algorithms for Metric Facility Location and.. - Jain, Vazirani (2001) (154 citations) (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k- median problem. Proc. 31st ACM Symp. on Theory of Computing, 1-10, 1999.
The k-Median Problem for Directed Trees - Preliminary Version Marek (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. Shmoys. A constant-factor approximation algorithm for the k-median problem. In Proc. 31st Annual ACM Symposium on Theory of Computing (STOC'99), 1999.
Online Maintenance of k-Medians and k-Covers - On Line Rudolf (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D.B. Shmoys. "A constant-factor approximation algorithm for the k-median problem," Journal Computer System Sciences, 65, 2002, pp. 129-149.
Scalable, Ad Hoc Deployable RF-based Localization - Nirupama Bulusu Vladimir (Correct)
No context found.
M. Charikar, S. Guha, D. Shmoys, and E. Tardos. A constant-factor approximation algorithm for the k median problem. In Proc. of ACM STOC 1999.
Polynomial Time Approximation Schemes for Metric.. - Vega, Karpinski.. (2002) (2 citations) (Correct)
No context found.
M. Charikar, S. Guha, D.B. Shmoys, and ' E. Tardos. A constant factor approximation algorithm for the k-median problem. In Proc. of the 31st Ann. ACM Symp. on Theory of Computing, 1999.
Scalable, Ad Hoc Deployable RF-based Localization - Nirupama Bulusu Vladimir (Correct)
No context found.
M. Charikar, S. Guha, D. Shmoys, and E. Tardos. A constant-factor approximation algorithm for the k median problem. In Proc. of ACM STOC 1999.
Approximation Algorithms for Hierarchical Location Problems.. - Plaxton (2003) (Correct)
No context found.
M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. Journal of Computer and System Sciences, 65:129--149, 2002.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC