A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. Multiway Cuts in Directed and Node Weighted Graphs , 1994, ICALP.
[2] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..
[3] Joseph Cheriyan,et al. Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching , 1998, Electron. Colloquium Comput. Complex..
[4] David P. Williamson,et al. A primal-dual schema based approximation algorithm for the element connectivity problem , 2002, SODA '99.
[5] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[6] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[7] David P. Williamson,et al. A primal-dual approximation algorithm for generalized steiner network problems , 1993, Comb..
[8] Andrew V. Goldberg,et al. Improved approximation algorithms for network design problems , 1994, SODA '94.
[9] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[10] Vijay V. Vazirani,et al. On the bidirected cut relaxation for the metric Steiner tree problem , 1999, SODA '99.
[11] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..
[12] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[13] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..
[14] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .