Cost Sharing and Approximation
暂无分享,去创建一个
[1] R. Ravi,et al. Boosted sampling: approximation algorithms for stochastic optimization , 2004, STOC '04.
[2] Chaitanya Swamy,et al. Stochastic optimization is (almost) as easy as deterministic optimization , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[3] Lisa Zhang,et al. Approximation Algorithms for Access Network Design , 2002, Algorithmica.
[4] Tim Roughgarden,et al. Simpler and better approximation algorithms for network design , 2003, STOC '03.
[5] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.
[6] Jochen Könemann,et al. A group-strategyproof mechanism for Steiner forests , 2005, SODA '05.
[7] Lloyd S. Shapley,et al. On balanced sets and cores , 1967 .
[8] R. Ravi,et al. Approximating the Single-Sink Link-Installation Problem in Network Design , 2001, SIAM J. Optim..
[9] Alex Zelikovsky,et al. Improved Steiner tree approximation in graphs , 2000, SODA '00.
[10] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[11] Joseph Naor,et al. A deterministic algorithm for the cost-distance problem , 2001, SODA '01.
[12] Matthew Andrews,et al. Hardness of buy-at-bulk network design , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[13] David R. Karger,et al. Building Steiner trees with incomplete global knowledge , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[14] Tim Roughgarden,et al. A constant-factor approximation algorithm for the multicommodity rent-or-buy problem , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[15] Kamesh Munagala,et al. Cost-distance: two metric network design , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[16] R. Ravi,et al. On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem , 2001, IPCO.
[17] Marshall W. Bern,et al. The Steiner Problem with Edge Lengths 1 and 2 , 1989, Inf. Process. Lett..
[18] Baruch Awerbuch,et al. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.
[19] Piotr Indyk,et al. On page migration and other relaxed task systems , 1997, SODA '97.
[20] H. Moulin. Cooperative Microeconomics: A Game-Theoretic Introduction , 1995 .
[21] Rolf H. Möhring,et al. Approximation in stochastic scheduling: the power of LP-based priority policies , 1999, JACM.
[22] Vijay V. Vazirani,et al. Primal-dual approximation algorithms for metric facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[23] Timothy J. Lowe,et al. On the location of a tree-shaped facility , 1996, Networks.
[24] Kunal Talwar,et al. The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap , 2002, IPCO.
[25] Hans Haller,et al. Nash Networks with Heterogeneous Agents , 2000 .
[26] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[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] R. Ravi,et al. Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design , 1999, ESA.
[29] Steve Y. Chiu,et al. A Branch and Cut Algorithm for a Steiner Tree-Star Problem , 1996, INFORMS J. Comput..
[30] Yuval Rabani,et al. Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..
[31] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[32] Amitabh Sinha,et al. Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems , 2006, Math. Program..
[33] E. Beale. ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .
[34] Chaitanya Swamy,et al. Primal–Dual Algorithms for Connected Facility Location Problems , 2004, Algorithmica.
[35] A. Frieze,et al. On the random 2-stage minimum spanning tree , 2006 .
[36] David B. Shmoys,et al. Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties , 2003, ESA.
[37] Kamesh Munagala,et al. Designing networks incrementally , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[38] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[39] Sudipto Guha,et al. Hierarchical placement and network design problems , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[40] Martin Skutella,et al. Scheduling precedence-constrained jobs with stochastic processing times on parallel machines , 2001, SODA '01.
[41] William W. Sharkey,et al. Cost allocation , 1996 .
[42] Vijay V. Vazirani,et al. Applications of approximation algorithms to cooperative games , 2001, STOC '01.
[43] Deborah Estrin,et al. Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk , 2003, SODA '03.
[44] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[45] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .
[46] Ashish Goel,et al. Stochastic load balancing and related problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[47] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.