Author:
Cheriyan Joseph,Jordán Tibor,Nutov Zeev
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. D. Bienstock, E. F. Brickell and C. L. Monma, “On the structure of minimum-weight k-connected spanning networks,” SIAM J. Discrete Math.
3 (1990), 320–329.
2. B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978.
3. J.Cheriyan and R.Thurimella, “Approximating minimum-size k-connected spanning subgraphs via matching,” manuscript, Sept. 1996. ECCC TR98-025, see http://www.eccc.uni-trier.de/eccc-local/Lists/TR-1998.html. Preliminary version in Proc. 37th IEEE FOCS (1996), 292–301.
4. A.Frank and E. Tardos, “An application of submodular flows,” Linear Algebra and its Applications, 114/115 (1989), 320–348.
5. G.L.Frederickson and J. Ja'Ja', “On the relationship between the biconnectivity augmentation and traveling salesman problems,” Theor. Comp. Sci.
19 (1982), 189–201.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献