Randomized rounding in the presence of a cardinality constraint

2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009

Volumn , Issue , 2009, Pages 162-174

  Doerr, Benjamin ^a   Wahlström, Magnus ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INDUSTRIAL ENGINEERING;

CARDINALITY CONSTRAINTS; DERANDOMIZATION; EXPERIMENTAL COMPARISON; RANDOMIZED APPROACH; RANDOMIZED ROUNDING; ROUNDING ERRORS; RUNNING TIME; TREE-BASED APPROACH;

ENGINEERING;

EID: 77956518496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972894.16     Document Type: Conference Paper

References (25)

1. [AS99] A. A. Ageev and M. Sviridenko. Approximation algorithms for maximum coverage and max cut with given sizes of parts. In G. Cornúejols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization (IPCO), volume 1610 of Lecture Notes in Computer Science, pages 17-30. Springer, 1999.
2. [AS00] A. A. Ageev and M. Sviridenko. An approximation algorithm for hypergraph Max-Cut with given sizes of parts. In M. Paterson, editor, Algorithms - ESA 2000, volume 1879 of Lecture Notes in Computer Science, pages 32-41. Springer, 2000.
3. [AS04] A. A. Ageev and M. I. Sviridenko. Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Comb. Optim., 8:307-328, 2004.
4. [AFK02] S. Arora, A. Frieze, and H. Kaplan. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math. Program., 92:1-36, 2002.
5. [AKOT03] T. Asano, N. Katoh, K. Obokata, and T. Tokuyama. Matrix rounding under the Lpdiscrepancy measure and its application to digital halftoning. SIAM J. Comput., 32:1423-1435, 2003.
6. [CCE85] B. D. Causey, L. H. Cox, and L. R. Ernst. Applications of transportation theory to statistical problems. Journal of the American Statistical Association, 80:903-909, 1985.
7. [CN06] J. Chuzhoy and J. Naor. Covering problems with hard capacities. SIAM J. Comput., 36:498-515, 2006.
8. [DR89] G.S. Ditlow and P. Raghavan. Timing-driven partitioning of PLAs. Technical Report 31, IBM Technical Disclosure Bulletin, 1989.
9. [Doe04] B. Doerr. Nonindependent randomized rounding and an application to digital halftoning. SIAM Journal on Computing, 34:299-317, 2004.
10. [Doe05] B. Doerr. Roundings respecting hard constraints. In Proceedings of STACS'05, volume 3404 of Lecture Notes in Computer Science, pages 617-628, 2005.
11. [Doe06] B. Doerr. Generating randomized roundings with cardinality constraints and derandomizations. In Proceedings of STACS'06, volume 3884 of Lecture Notes in Computer Science, pages 571-583, 2006.
12. [Doe07] B. Doerr. Randomly rounding rationals with cardinality constraints and derandomizations. In Proceedings of STACS'07, volume 4393 of Lecture Notes in Computer Science, pages 441-452, 2007.
13. [DG06] B. Doerr and M. Gnewuch. Construction of lowdiscrepancy point sets of small size by bracketing covers and dependent randomized rounding. In A. Keller, S. Heinrich and H. Niederreiter, editors, Monte Carlo and Quasi-Monte Carlo Methods 2006, pages 299-312, 2008. Springer-Verlag.
14. [GHK+03] R. Gandhi, E. Halperin, S. Khuller, G. Kortsarz, and A. Srinivasan. An improved approximation algorithm for vertex cover with hard capacities. In Proceedings of ICALP'03, volume 2719 of Lecture Notes in Computer Science, pages 164-175, 2003.
15. [GKPS02] R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan. Dependent rounding in bipartite graphs. In Proceedings of FOCS'02, pages 323-332, 2002.
16. [GKPS06] R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan. Dependent rounding and its applications to approximation algorithms. J. ACM, 53:324- 360, 2006.
17. [GKR+03] V. Guruswami, S. Khanna, R. Rajaraman, F. B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci., 67:473-496, 2003.
18. [Hro05] J. Hromkovic. Design and analysis of randomized algorithms. Introduction to design paradigms. Springer-Verlag, Berlin, 2005.
19. [LA08] D. L. Lau and G. R. Arce. Modern Digital Halftoning. CRC Press. 2008.
20. [MNR97] R. Motwani, J. Naor, and P. Raghavan. Randomized approximation algorithms in combinatorial optimization. In D. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, pages 447-481. PWS Publishing Co., Boston, MA, U.S.A, 1997.
21. [NRT87] A.P-C. Ng, P. Raghavan, and C.D. Thompson. Experimental results for a linear program global router. Computers and Artificial Intelligence, 6:229-242, 1987.
22. [Rag88] P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci., 37:130-143, 1988.
23. [RT87] P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
24. [RT91] P. Raghavan and C. D. Thompson. Multiterminal global routing: A deterministic approximation scheme. Algorithmica, 6:73-82, 1991.
25. [Sri01] A. Srinivasan. Distributions on level-sets with applications to approximations algorithms. In Proceedings of FOCS'01, pages 588-597, 2001.