Online Buy-at-Bulk Network Design
暂无分享,去创建一个
[1] Matthew Andrews,et al. Hardness of buy-at-bulk network design , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[2] R. Ravi,et al. A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.
[3] Mohammad Taghi Hajiaghayi,et al. Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design , 2010, SIAM J. Comput..
[4] Noga Alon,et al. The online set cover problem , 2003, STOC '03.
[5] Alex Zelikovsky,et al. An improved approximation scheme for the Group Steiner Problem , 2001, Networks.
[6] Adam Meyerson,et al. Online algorithms for network design , 2004, SPAA '04.
[7] Yossi Azar,et al. Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[8] Mohammad Taghi Hajiaghayi,et al. Online Node-Weighted Steiner Forest and Extensions via Disk Paintings , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[9] Tim Roughgarden,et al. Simpler and better approximation algorithms for network design , 2003, STOC '03.
[10] Piotr Berman,et al. On-line algorithms for Steiner tree problems (extended abstract) , 1997, STOC '97.
[11] Sudipto Guha,et al. A Constant Factor Approximation for the Single Sink Edge Installation Problem , 2009, SIAM J. Comput..
[12] Kunal Talwar,et al. The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap , 2002, IPCO.
[13] Anupam Gupta,et al. Set connectivity problems in undirected graphs and the directed Steiner network problem , 2008, SODA '08.
[14] Yossi Azar,et al. Online Mixed Packing and Covering , 2012, SODA.
[15] Mohit Singh,et al. Online Node-Weighted Steiner Tree and Related Problems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[16] Makoto Imase,et al. Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..
[17] Sanjeev Khanna,et al. Design networks with bounded pairwise distance , 1999, STOC '99.
[18] Spyridon Antonakopoulos. Approximating Directed Buy-at-Bulk Network Design , 2010, WAOA.
[19] Samir Khuller,et al. On directed Steiner trees , 2002, SODA '02.
[20] Guy Kortsarz,et al. Improved approximating algorithms for Directed Steiner Forest , 2009, SODA.
[21] Noga Alon,et al. A general approach to online network optimization problems , 2004, SODA '04.
[22] Moses Charikar,et al. On non-uniform multicommodity buy-at-bulk network design , 2005, STOC '05.
[23] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[24] Sudipto Guha,et al. Approximation algorithms for directed Steiner problems , 1999, SODA '98.
[25] Mohammad Taghi Hajiaghayi,et al. Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems , 2014, ICALP.
[26] Piotr Berman,et al. Approximation algorithms for spanner problems and Directed Steiner Forest , 2013, Inf. Comput..
[27] Tim Roughgarden,et al. Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[28] Joseph Naor,et al. Online Primal-Dual Algorithms for Covering and Packing , 2009, Math. Oper. Res..
[29] R. Ravi,et al. Approximating the Single-Sink Link-Installation Problem in Network Design , 2001, SIAM J. Optim..
[30] Alex Zelikovsky,et al. A series of approximation algorithms for the acyclic directed steiner tree problem , 1997, Algorithmica.
[31] Mohammad Taghi Hajiaghayi,et al. Approximation algorithms for node-weighted buy-at-bulk network design , 2007, SODA '07.
[32] Kamesh Munagala,et al. Cost-Distance: Two Metric Network Design , 2008, SIAM J. Comput..
[33] Joseph Naor,et al. A deterministic algorithm for the cost-distance problem , 2001, SODA '01.