Primal-Dual-Based Algorithms for a Directed Network Design Problem
暂无分享,去创建一个
[1] Ran Raz,et al. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.
[2] Éva Tardos,et al. Approximation Algorithms for a Directed Network Design Problem , 1999, IPCO.
[3] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..
[4] Vijay V. Vazirani,et al. Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.
[5] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[6] Vijay V. Vazirani,et al. On the bidirected cut relaxation for the metric Steiner tree problem , 1999, SODA '99.
[7] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..
[8] David P. Williamson,et al. A primal-dual approximation algorithm for generalized steiner network problems , 1995, Comb..
[9] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[10] Kamal Jain,et al. A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[11] Samir Khuller,et al. A uniform framework for approximating weighted connectivity problems , 1999, SODA '99.