A general approximation technique for constrained forest problems
暂无分享,去创建一个
[1] H. Gabow. An E cient Approximation Algorithmfor the Survivable Network Design Problem , 1993 .
[2] Chung-Lun Li,et al. The point-to-point delivery and connection problems: complexity and algorithms , 1992, Discret. Appl. Math..
[3] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[4] Gilbert Laporte,et al. Location routing problems , 1987 .
[5] Andrew V. Goldberg,et al. Improved approximation algorithms for network design problems , 1994, SODA '94.
[6] B. M. Fulk. MATH , 1992 .
[7] Edward M. Reingold,et al. Heuristics for weighted perfect matching , 1980, STOC '80.
[8] David P. Williamson,et al. Computational experience with an approximation algorithm on large-scale Euclidean matching instances , 1994, SODA '94.
[9] David P. Williamson,et al. A note on the prize collecting traveling salesman problem , 1993, Math. Program..
[10] Harold N. Gabow,et al. A scaling algorithm for weighted matching on general graphs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[11] Robert E. Tarjan,et al. Faster scaling algorithms for general graph matching problems , 1991, JACM.
[12] R. Ravi,et al. When cycles collapse: A general approximation technique for constrained two-connectivity problems , 1992, IPCO.
[13] G. Laporte,et al. Hamiltonian location problems , 1983 .
[14] David P. Williamson. On the design of approximation algorithms for a class of graph problems , 1993 .
[15] David A. Plaisted. Heuristic Matching for Graphs Satisfying the Triangle Inequality , 1984, J. Algorithms.
[16] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..
[17] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[18] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[19] David P. Williamson,et al. Approximating minimum-cost graph problems with spanning tree edges , 1994, Oper. Res. Lett..
[20] Zvi Galil,et al. Efficient Implementation of Graph Algorithms Using Contraction , 1984, FOCS.
[21] Harold N. Gabow,et al. Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.
[22] W. Cunningham,et al. A primal algorithm for optimum matching , 1978 .
[23] Piotr Berman,et al. Improved approximations for the Steiner tree problem , 1992, SODA '92.
[24] Egon Balas,et al. The prize collecting traveling salesman problem , 1989, Networks.
[25] Leonid Khachiyan,et al. A greedy heuristic for a minimum-weight forest problem , 1993, Oper. Res. Lett..
[26] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[27] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[28] David P. Williamson,et al. A primal-dual approximation algorithm for generalized steiner network problems , 1993, Comb..
[29] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[30] T. A. J. Nicholson,et al. Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..
[31] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[32] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[33] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..
[34] Robert E. Tarjan,et al. On a Greedy Heuristic for Complete Matching , 1981, SIAM J. Comput..
[35] Michel X. Goemans,et al. Survivable networks, linear programming relaxations and the parsimonious property , 1993, Math. Program..