Author:
Biniaz Ahmad,Maheshwari Anil,Smid Michiel
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference26 articles.
1. The Euclidean bottleneck full Steiner tree problem;Abu-Affash;Algorithmica,2015
2. On approximating arbitrary metrics by tree metrics;Bartal,1998
3. Approximating full Steiner tree in a unit disk graph;Biniaz,2014
4. An optimal algorithm for the Euclidean bottleneck full Steiner tree problem;Biniaz;Comput. Geom.,2014
5. Approximation algorithms for directed Steiner problems;Charikar;J. Algorithms,1999
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献