Randomly rounding rationals with cardinality constraints and derandomizations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4393 LNCS, Issue , 2007, Pages 441-452

  Doerr, Benjamin ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; RANDOM PROCESSES; RANDOM VARIABLES; VECTORS;

DERANDOMIZATION; RATIONAL MATRICES; UNIMODULAR HYPERGRAPHS;

CONSTRAINT THEORY;

EID: 34547664809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_38     Document Type: Conference Paper

References (17)

1. 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.
2. B. Doerr, M. Gnewuch, and A. Srivastav. Bounds and constructions for the star-discrepancy via δ-covers. Journal of Complexity, 21:691-709, 2005.
3. B. Doerr and C. Klein. Unbiased rounding of rational matrices. In FSTTCS 2006, volume 4337 of LNCS, pages 200-211, 2006. Springer-Verlag.
4. B. Doerr. Non-independent randomized rounding. In SODA 2003, pages 506-507, 2003.
5. B. Doerr. Global roundings of sequences. Information Processing Letters, 92:113-116, 2004.
6. B. Doerr. Nonindependent randomized rounding and an application to digital halftoning. SIAM Journal on Computing, 34:299-317, 2004.
7. B. Doerr. Generating randomized roundings with cardinality constraints and derandomizations. In STACS 2006, volume 3884 of LNCS, pages 571-583, 2006. Springer-Verlag.
8. D. de Werra. Equitable colorations of graphs. Rev. Française Informat. Recherche Opérationnelle, 5(Ser. R-3):3-8, 1971.
9. R. Gandhi, E. Halperin, S. Khuller, G. Kortsarz, and A. Srinivasan. An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci, 72:16-33, 2006.
10. R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan. Dependent rounding in bipartite graphs. In FOCS 2002, pages 323-332, 2002.
11. A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Comput., 26:350-368, 1997.
12. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci., 37:130-143, 1988.
13. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
14. P. Raghavan and C. D. Thompson. Multiterminal global routing: a deterministic approximation scheme. Algorithmica, 6:73-82, 1991.
15. A. Srinivasan. Distributions on level-sets with applications to approximations algorithms. In FOCS 2001, pages 588-597, 2001.
16. A. Srivastav and P. Stangier. Algorithmic Chernoff-Hoeffding inequalities in integer programming. Random Structures & Algorithms, 8:27-58, 1996.
17. K. Sadakane, N. Takki-Chebihi, and T. Tokuyama. Combinatorics and algorithms on low-discrepancy roundings of a real sequence. In ICALP 2001, volume 2076 of LNCS, pages 166-177, 2001. Springer-Verlag.