Network design for information networks
暂无分享,去创建一个
[1] 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.
[2] Chaitanya Swamy,et al. Primal–Dual Algorithms for Connected Facility Location Problems , 2004, Algorithmica.
[3] Ravi Ramamoorthi,et al. Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design , 2002, IPCO.
[4] Helmut Veith,et al. Efficient filtering in publish-subscribe systems using binary decision diagrams , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.
[5] David R. Karger,et al. Building Steiner trees with incomplete global knowledge , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[6] Chaitanya Swamy,et al. Facility location with Service Installation Costs , 2004, SODA '04.
[7] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[8] Yossi Azar,et al. Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[9] R. Ravi,et al. An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design , 2004, FOCS.
[10] R. Ravi,et al. Boosted sampling: approximation algorithms for stochastic optimization , 2004, STOC '04.
[11] 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..
[12] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..
[13] R. Ravi,et al. Multicommodity facility location , 2004, SODA '04.
[14] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[15] Chaitanya Swamy,et al. Stochastic optimization is (almost) as easy as deterministic optimization , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[16] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[17] Deborah Estrin,et al. Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk , 2003, SODA '03.