Author:
Hibi Tomoya,Fujito Toshihiro
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: An improved LP-based approximation for Steiner tree. In: Proc. 42nd STOC, pp. 583–592 (2010)
2. Berman, P., Ramaiyer, V.: Improved approximations for the Steiner tree problem. In: Proc. 3rd SODA, pp. 325–334 (1992)
3. Chlebík, M., Chlebíková, J.: The Steiner tree problem on graphs: Inapproximability results. Theory Comput. Syst. 406(3), 207–214 (2008)
4. Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner tree problems. J. Algorithms 33, 73–91 (1999)
5. Calinescu, G., Zelikovsky, A.: The polymatroid Steiner problems. J. Comb. Opt. 9, 281–294 (2005)