Author:
Abu-Affash A. Karim,Carmi Paz,Katz Matthew J.
Funder
Israel Science Foundation
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. On the Euclidean bottleneck full Steiner tree problem;Abu-Affash,2011
2. The Euclidean bottleneck Steiner path problem;Abu-Affash,2011
3. Polynomial time approximation schemes for Euclidean TSP and other geometric problems;Arora;J. ACM,1998
4. Proof verification and hardness of approximation problems;Arora,1992
5. On exact solutions to the Euclidean bottleneck Steiner tree problem;Bae;Inf. Process. Lett.,2010
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献