Author:
Awasthi Pranjal,Blum Avrim,Sheffet Or
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference22 articles.
1. Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon Kleinberg, Ofer Neiman, Aleksandrs Slivkins, Metric embeddings with relaxed guarantees, in: Proc. 46th Annual IEEE Symp. Foundations of Computer Science (FOCS), 2005.
2. Sanjeev Arora, Prabhakar Raghavan, Satish Rao, Approximation schemes for euclidean k-medians and related problems, in: Proc. 30th Annual ACM Symp. Theory of Computing (STOC), 1998.
3. Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit, Local search heuristic for k-median and facility location problems, in: Proc. 33rd ACM Symp. Theory of Computing (STOC), 2001.
4. Pranjal Awasthi, Avrim Blum, Or Sheffet, Stability yields a PTAS for k-median and k-means clustering, in: Proc. 51st Annual IEEE Symp. Foundations of Computer Science (FOCS), 2010.
5. Maria-Florina Balcan, Avrim Blum, Anupam Gupta, Approximate clustering without the approximation, in: Proc. 19th Annual ACM–SIAM Symp. Discrete Algorithms (SODA), 2009.
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献