Survivable Network Activation Problems
暂无分享,去创建一个
[1] G. Kortsarz,et al. Approximating minimum cost connectivity problems , 2007 .
[2] R. Ravi,et al. A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.
[3] Zeev Nutov. Approximating subset k-connectivity problems , 2012, J. Discrete Algorithms.
[4] Zeev Nutov. Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[5] Sanjeev Khanna,et al. Algorithms for Single-Source Vertex Connectivity , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[6] Guy Kortsarz,et al. Approximating Node Connectivity Problems via Set Covers , 2003, Algorithmica.
[7] Debmalya Panigrahi,et al. Survivable network design problems in wireless networks , 2011, SODA '11.
[8] Zeev Nutov,et al. Approximating minimum power covers of intersecting families and directed edge-connectivity problems , 2010, Theor. Comput. Sci..
[9] András Frank,et al. Rooted k-connections in digraphs , 2009, Discret. Appl. Math..
[10] David P. Williamson,et al. Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems , 2006, J. Comput. Syst. Sci..
[11] Zeev Nutov. Approximating Steiner Networks with Node-Weights , 2010, SIAM J. Comput..
[12] Nachshon Cohen,et al. Approximating Minimum Power Edge-Multi-Covers , 2012, CSR.