Algorithms for a network design problem with crossing supermodular demands
暂无分享,去创建一个
[1] David P. Williamson,et al. A primal-dual approximation algorithm for generalized steiner network problems , 1995, Comb..
[2] 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.
[3] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[4] Andrew V. Goldberg,et al. Improved approximation algorithms for network design problems , 1994, SODA '94.
[5] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[6] Samir Khuller,et al. Biconnectivity approximations and graph carvings , 1992, STOC '92.
[7] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..
[8] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[9] David P. Williamson,et al. A primal-dual approximation algorithm for generalized steiner network problems , 1993, Comb..
[10] Alex Zelikovsky. A series of approximation algorithms for the acyclic directed steiner tree problem , 2006, Algorithmica.
[11] Éva Tardos,et al. How to tidy up your set-system? , 1988 .
[12] 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).
[13] Sudipto Guha,et al. Approximation algorithms for directed Steiner problems , 1999, SODA '98.