Author:
Berman Piotr,Fürer Martin,Zelikovsky Alexander
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Bern, M., Plassmann, P.: The Steiner tree problem with edge lengths 1 and 2. Inform. Process. Lett. 32, 171–176 (1989)
2. Calinescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. In: Proc. 7th SODA, pp. 16–25 (1996)
3. Lecture Notes in Computer Science;H.N. Gabow,1985
4. Gröpl, C., Hougardy, S., Nierhoff, T., Prömel, H.J.: Steiner trees in uniformly quasi-bipartite graphs. Information Processing Letters 83, 195–200 (2002)
5. Lovász, L.: The matroid matching problem. Algebraic Methods in Graph Theory 2, 495–518 (1981)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献