Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference3 articles.
1. Probabilistic analysis of the euclidean k-median problem;Fisher,1978
2. Some NP-complete geometric problems;Garey;Proceedings 8th ACM Symposium on Theory of Computing,1976
3. The euclidean travelling salesman problem is NP-complete;Papadimitriou;Theoretical Computer Science,1977
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献