Non-independent randomized rounding

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 506-507

  Doerr, Benjamin ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; CORRELATION METHODS; ERROR ANALYSIS; GRAPH THEORY; INTEGRAL EQUATIONS; LINEAR SYSTEMS; MATRIX ALGEBRA; PROBABILITY; SET THEORY; THEOREM PROVING; VECTORS;

HYPERGRAPH; RANDOMIZED ROUNDING TECHNIQUE;

RANDOM PROCESSES;

EID: 0037739963     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. p-discrepancy measure and its application to digital halftoning. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
2. D. Bertsimas, C. Teo, and R. Vohra. On dependent randomized rounding algorithms. Oper. Res. Lett., 24:105-114, 1999.
3. B. Doerr and H. Schnieder. Non-independent randomized rounding and an application to digital halftoning. Proceedings of ESA 2002, volume 2461 of Lecture Notes in Computer Science, pages 399-410, Berlin-Heidelberg, 2002. Springer-Verlag.
4. A. Ghouila-Houri. Caractérisation des matrices totalement unimodulaires. C. R. Acad. Sci. Paris, 254:1192-1194, 1962.
5. A. J. Hoffman and J. B. Kruskal. Integral boundary points of convex polyhedra. In H. W. Kuhn and A. W. Tucker, editors, Linear Inequalities and Related Systems, pages 223-246, 1956.
6. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci., 37:130-143, 1988.
7. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365-374, 1987.
8. A. Srinivasan. Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput., 29:648-670, 1999.
9. A. Srinivasan. Distributions on level-sets with applications to approximations algorithms. In Proc. 41th Ann. IEEE Symp. on Foundations of Computer Science, pages 588-597, 2001.