Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference27 articles.
1. Bern M, Plassmann P (1989) The Steiner tree problem with edge lengths 1 and 2. Inf Process Lett 32:171–176
2. Bui M, Butelle F, Lavault C (2004) A distributed algorithm for constructing a minimum diameter spanning tree. J Parallel Distrib Comput 64(5):571–577
3. Byrka J, Grandoni F, Rothvoss T, Sanita L (2010) An improved LP-based approximation for steiner tree. In: Proceedings of the 42th ACM symposium on theory of computing (STOC 2010), pp 583–592
4. Chan TM (2002) Semi-online maintenance of geometric optima and measures. In: Proceedings of 13th ACM-SIAM symposium on discrete algorithms (SODA 2002), pp 474–483
5. Chen YH (2011) An improved approximation algorithm for the terminal Steiner tree problem. In: Murgante B et al. (eds) ICCSA 2011, Part III, LNCS 6784, pp 141–151
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献