Tight approximation algorithms for maximum general assignment problems
暂无分享,去创建一个
Vahab S. Mirrokni | Michel X. Goemans | Maxim Sviridenko | Lisa Fleischer | V. Mirrokni | M. Goemans | L. Fleischer | M. Sviridenko
[1] David B. Shmoys,et al. An improved approximation algorithm for the partial latin square extension problem , 2003, SODA '03.
[2] V. Mirrokni,et al. Tight approximation algorithms for maximum general assignment problems , 2006, SODA 2006.
[3] Chaitanya Swamy. Algorithms for the data placement problem , 2004 .
[4] Uriel Feige,et al. Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[5] Jan Vondrák,et al. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.
[6] Vahab Mirrokni,et al. Approximation algorithms for distributed and selfish agents , 2005 .
[7] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[8] Aravind Srinivasan,et al. Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[9] Vijay Kumar,et al. Approximation Algorithms for Budget-Constrained Auctions , 2001, RANDOM-APPROX.
[10] Yishay Mansour,et al. Auctions with Budget Constraints , 2004, SWAT.
[11] Raphael Yuster,et al. A ( 1 − 1 / e )-approximation algorithm for the maximum generalized assignment problem with fixed profits , 2005 .
[12] Sanjeev Khanna,et al. A PTAS for the multiple knapsack problem , 2000, SODA '00.
[13] Mohammad R. Salavatipour,et al. Packing Steiner trees , 2003, SODA '03.
[14] Adrian Vetta,et al. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[15] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[16] Vahab S. Mirrokni,et al. Sink equilibria and convergence , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[17] Neal E. Young,et al. Sequential and parallel algorithms for mixed packing and covering , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Neal E. Young,et al. Randomized rounding without solving the linear program , 1995, SODA '95.
[19] Raphael Yuster,et al. A (1-1/e)-approximation algorithm for the generalized assignment problem , 2006, Oper. Res. Lett..
[20] Hadas Shachnai,et al. Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement , 2003, RANDOM-APPROX.
[21] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[22] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[23] Gagan Goel,et al. On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[24] Maxim Sviridenko,et al. A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..
[25] Robert D. Carr,et al. Randomized metarounding , 2002, Random Struct. Algorithms.
[26] Rajmohan Rajaraman,et al. Approximation algorithms for data placement in arbitrary networks , 2001, SODA '01.
[27] Mihalis Yannakakis,et al. On the complexity of local search , 1990, STOC '90.
[28] Uriel Feige,et al. Approximating the domatic number , 2000, STOC '00.
[29] Mihalis Yannakakis,et al. Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..
[30] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.
[31] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[32] David P. Williamson,et al. New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..
[33] Marina Thottan,et al. Market sharing games applied to content distribution in ad hoc networks , 2004, IEEE Journal on Selected Areas in Communications.
[34] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[35] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[36] Klaus Jansen,et al. On rectangle packing: maximizing benefits , 2004, SODA '04.
[37] Chaitanya Swamy,et al. Approximation Algorithms for Data Placement Problems , 2008, SIAM J. Comput..
[38] J. Nash. Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.