Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
暂无分享,去创建一个
[1] D. Welsh,et al. Combinatorial applications of an inequality from statistical mechanics , 1975, Mathematical Proceedings of the Cambridge Philosophical Society.
[2] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[3] William H. Cunningham,et al. Testing membership in matroid polyhedra , 1984, J. Comb. Theory, Ser. B.
[4] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[5] Aravind Srinivasan,et al. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..
[6] U. Feige. A threshold of ln n for approximating set cover , 1998, JACM.
[7] Gerhard J. Woeginger,et al. When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? , 2000, INFORMS J. Comput..
[8] Aravind Srinivasan,et al. Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[9] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 2002, Math. Program..
[10] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[11] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[12] Benjamin Doerr. Generating Randomized Roundings with Cardinality Constraints and Derandomizations , 2006, STACS.
[13] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[14] Benjamin Doerr. Randomly Rounding Rationals with Cardinality Constraints and Derandomizations , 2007, STACS.
[15] Subhash Khot,et al. Approximation Algorithms for the Max-Min Allocation Problem , 2007, APPROX-RANDOM.
[16] Jan Vondrák,et al. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.
[17] Amin Saberi,et al. An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.
[18] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[19] Vahab S. Mirrokni,et al. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions , 2008, EC '08.
[20] V. Nagarajan,et al. MAXIMIZING NON-MONOTONE SUBMODULAR FUNCTIONS UNDER MATROID AND KNAPSACK CONSTRAINTS , 2007 .
[21] Jan Vondrák,et al. Symmetry and Approximability of Submodular Maximization Problems , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[22] Aravind Srinivasan,et al. A unified approach to scheduling on unrelated parallel machines , 2009, JACM.
[23] Sanjeev Khanna,et al. On Allocating Goods to Maximize Fairness , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[24] Chandra Chekuri,et al. Dependent Randomized Rounding for Matroid Polytopes and Applications , 2009, 0909.4348.
[25] Hadas Shachnai,et al. Maximizing submodular set functions subject to multiple linear constraints , 2009, SODA.
[26] Vahab S. Mirrokni,et al. Approximating submodular functions everywhere , 2009, SODA.
[27] Jan Vondrák,et al. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2009, Math. Oper. Res..
[28] Aravind Srinivasan,et al. A new approximation technique for resource‐allocation problems , 2010, ICS.
[29] Vahab S. Mirrokni,et al. Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints , 2009, SIAM J. Discret. Math..
[30] Amin Saberi,et al. An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.
[31] Aravind Srinivasan,et al. Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm , 2010, IPCO.
[32] Amin Saberi,et al. An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.
[33] Jan Vondrák,et al. Multi-budgeted matchings and matroid intersection via dependent rounding , 2011, SODA '11.