Embeddings and non-approximability of geometric problems
暂无分享,去创建一个
[1] Samir Khuller,et al. Greedy strikes back: improved facility location algorithms , 1998, SODA '98.
[2] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[3] Satish Rao,et al. A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem , 1999, ESA.
[4] Moses Charikar,et al. Approximating min-sum k-clustering in metric spaces , 2001, STOC '01.
[5] Marek Karpinski,et al. Polynomial Time Approximation Schemes for Metric Min-Sum Clustering , 2002, Electron. Colloquium Comput. Complex..
[6] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.
[7] Satish Rao,et al. Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.