Dependent randomized rounding via exchange properties of combinatorial structures

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 575-584

  Chekuri, Chandra ^a   Vondrák, Jan ^b   Zenklusen, Rico ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ASSIGNMENT POLYTOPE; COMBINATORIAL STRUCTURES; CONCENTRATION BOUNDS; CONCENTRATION PROPERTIES; FRACTIONAL SOLUTIONS; MATROID INTERSECTION; NEGATIVE CORRELATION; SUBMODULAR FUNCTIONS;

COMBINATORIAL MATHEMATICS;

EID: 78751486031     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.60     Document Type: Conference Paper

References (35)

1. S. Arora, A. Frieze and H. Kaplan. A new rounding procedure for the assignment problem with applications to dense graph assignment problems. Math. Programming Ser A, 92: 1-36, 2002.
2. A. Asadpour, M. Goemans, A. Madry, S. Oveis Gharan, and A. Saberi. An O(log n/log log n)-approximation algorithm for the assymetric traveling salesman problem. Proc. of ACM-SIAM SODA, 2010.
3. A. Asadpour and A. Saberi. An approximation algorithm for max-min fair allocation of indivisible goods. Proc. of ACM STOC, 2007.
4. A. Ageev and M. Sviridenko. Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J. of Combinatorial Optimization, 8:307-328, 2004.
5. J. Byrka, A. Srinivasan, and C. Swamy. Fault-tolerant facility location: a randomized dependent LP-rounding algorithm. Proc. of IPCO, 2010.
6. G. Calinescu, C. Chekuri, M. Pál and J. Vondrák. Maximizing a submodular set function subject to a matroid constraint. Proc. of IPCO, 182-196, 2007.
7. G. Calinescu, C. Chekuri, M. Pál and J. Vondrák. Maximizing a submodular set function subject to a matroid constraint. To appear in SIAM Journal on Computing, special issue for STOC 2008.
8. D. Chakrabarty, J. Chuzhoy and S. Khanna. On allocating goods to maximize fairness. Proc. of IEEE FOCS, 107-116, 2009.
9. C. Chekuri, S. Im and B. Moseley. Manuscript, 2009.
10. C. Chekuri, J. Vondrák, R. Zenklusen. Dependent randomized rounding for matroid polytopes and applications. Preprint, arXiv:0909.4348, November 2009.
11. C. Chekuri, J. Vondrák, R. Zenklusen. Multi-budgeted matchings and matroid intersection via dependent rounding. Manuscript, July 2010.
12. W. H. Cunningham. Testing membership in matroid polyhedra. Journal of Combinatorial Theory, Series B, 36(2):161-188, April 1984.
13. J. Edmonds. Matroids, submodular functions and certain polyhedra. Combinatorial Structures and Their Applications, Gordon and Breach, New York, 1970, 69-87.
14. B. Doerr. Generating randomized roundings with cardinality constraints and derandomizations. Proc. of STACS, 571-583, 2006.
15. B. Doerr. Randomly rounding rationals with cardinality constraints and derandomizations. Proc. of STACS, 441-452, 2007.
16. J. Edmonds. Matroid intersection. Discrete optimization I, North Holland, Amsterdam, 1979, 39-49.
17. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
18. M. L. Fisher, G. L. Nemhauser and L. A. Wolsey. An analysis of approximations for maximizing submodular set functions - II. Math. Prog. Study, 8:73-87, 1978.
19. R. Gandhi, S. Khuller, S. Parthasarathy and A. Srinivasan. Dependent rounding and its applications to approximation algorithms. Journal of the ACM 53:324-360, 2006. (Pubitemid 44180741)
20. M.X. Goemans, N. Harvey, S. Iwata and V. Mirrokni. Approximating submodular functions everywhere. Proc. of ACM-SIAM SODA, 535-544, 2009.
21. S. Khot and A.K. Ponnuswami. Approximation algorithms for the maxmin allocation problem. In APPROX-RANDOM 2007, 204-217.
22. A. Kulik, H. Shachnai and T. Tamir. Maximizing submodular set functions subject to multiple linear constraints. Proc. of ACM-SIAM SODA, 545-554, 2009.
23. V. S. A. Kumar, M. V. Marathe, S. Parthasarathy and A. Srinivasan. A unified approach to scheduling on unrelated parallel machines. JACM, Vol. 56, 2009.
24. J. Lee, V. Mirrokni, V. Nagarajan and M. Sviridenko. Maximizing non-monotone submodular functions under matroid and knapsack constraints. Proc. of ACM STOC 2009, 323-332.
25. J. Lee, M. Sviridenko, and J. Vondrák. Submodular maximization over multiple matroids via generalized exchange properties. Proc. of APPROX, Springer LNCS, 244-257, 2009.
26. V. Mirrokni, M. Schapira and J. Vondrák. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. Proc. of ACM EC, 2008.
27. A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM Journal on Computing 26:350-368, 1997.
28. P. Raghavan and C. D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4):365-374, 1987.
29. B. Saha and A. Srinivasan. A new approximation technique for resource-allocation problems. Proc. of ICS, 2010.
30. A. Schrijver. Combinatorial optimization - polyhedra and efficiency. Springer, 2003.
31. P.D. Seymour and D.J. Welsh. Combinatorial applications of an inequality from statistical mechanics. Mathematical proceedings of the Cambridge Philosophical Society 77, 485-495, 1975.
32. A. Srinivasan. Distributions on level-sets with applications to approximation algorithms, Proc. of IEEE FOCS, 588-597, 2001. (Pubitemid 33068420)
33. J. Vondrák. Optimal approximation for the submodular welfare problem in the value oracle model. Proc. of ACM STOC, 67-74, 2008.
34. J. Vondrák. Symmetry and approximability of submodular maximization problems. In Proc. of IEEE FOCS, 251-270, 2009.
35. G. J. Woeginger. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing, 12:5775, 2000.