R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric clustering problems. JACM, 49(2):139--156, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Approximation Schemes for Clustering Problems (Extended .. - Vega, Karpinski.. (2003) (Correct)
....[19] and has elicited much work and progress [5, 11, 22, 10] This is not the case in geometric settings, including the 2 case discussed in this paper. This case was considered by Drineas, Frieze, Kannan, Vempala, and Vinay [15] who gave a 2approximation algorithm. Ostrovsky and Rabani [26] gave a polynomial time approximation scheme for this case and other geometric settings. Our results improve significantly the running time for the 2 case. Recently and independently of our work, Badoiu, Har Peled, and Indyk [6] gave a polynomial time approximation scheme for the Euclidean case ....
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric clustering problems. J. of the ACM, 49(2):139--156, March 2002.
The Effectiveness of Lloyd-Type Methods for the k-Means.. - Rafail Ostrovsky Rafail Self-citation (Ostrovsky Rabani) (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric clustering problems. JACM, 49(2):139--156, 2002.
Approximation Schemes for Clustering Problems in.. - Vega, Karpinski.. (2002) Self-citation (Rabani) (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric clustering problems. J. of the ACM, 49(2):139-156, March 2002. 23
Polynomial Time Approximation Schemes for Metric.. - Vega, Karpinski.. (2002) (2 citations) Self-citation (Rabani) (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric clustering problems. J. of the ACM, 49(2):139-156, March 2002.
Polynomial Time Approximation Schemes for Metric.. - Vega, Karpinski.. (2002) (2 citations) Self-citation (Rabani) (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric clustering problems. J. of the ACM, 49(2):139--156, March 2002.
Machine Learning, 56, 9--33, 2004 - Clustering Large Graphs (Correct)
No context found.
Ostrovsky, R., & Rabani, Y. (2002). Polynomial time approximation schemes for geometric k-clustering. Journal of the ACM, 49:2, 139--156.
On the Complexity of Several Haplotyping Problems - Cilibrasi, van Iersel, Kelk.. (Correct)
No context found.
Rafail Ostrovsky and Yuval Rabani, Polynomial-Time Approximation Schemes for Geometric Min-Sum Median Clustering, Journal of the ACM 49(2), 139-156 (March 2002)
Mean Shift Based Clustering in High Dimensions: A.. - Georgescu, Shimshoni.. (2003) (3 citations) (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric k-clustering. In Proc. IEEE Symp. on Foundations of Computer Science, pages 349--358, 2000.
Approximate Clustering via Core-Sets - Badoiu, Har-Peled, Indyk (2002) (17 citations) (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric k-clustering. In Proc. 41st Symp. Foundations of Computer Science, pages 349--358. IEEE, Nov 2000. 18
Mean Shift Based Clustering in High Dimensions: A.. - Georgescu, Shimshoni.. (2003) (3 citations) (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric k-clustering. In Proc. IEEE Symp. on Foundations of Computer Science, pages 349--358, 2000.
On Finding Large Conjunctive Clusters - Mishra, Ron, Swaminathan (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric k-clustering. In IEEE, editor, 41st Annual Symposium on Foundations of Computer Science, pages 349-358, 2000.
Clustering Data Streams: Theory and Practice - Guha, Meyerson, Mishra.. (2003) (3 citations) (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric k-clustering. Proc. FOCS, 2000.
Mean Shift Based Clustering in High Dimensions: A.. - Georgescu, Shimshoni.. (2003) (3 citations) (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric k-clustering. In Proc. IEEE Symp. on Foundations of Computer Science, pages 349--358, 2000.
Clustering with the Connectivity Kernel - Fischer, Roth, Buhmann (2003) (2 citations) (Correct)
No context found.
R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric min-sum median clustering. Journal of the ACM, 49(2):139--156, 2002.
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