Roundings respecting hard constraints

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 617-628

  Doerr, Benjamin ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR SYSTEMS; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

BINARY VECTORS; LINEAR DISCREPANCY; ROUNDING PROBLEM;

LINEAR PROGRAMMING;

EID: 24144455585     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_51     Document Type: Conference Paper

References (18)

1. [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.
2. [AS] A. Ageev and M. Sviridenko. Pipage rounding: a new method of constructing algorithms with proven performance guarantee. Journal of Combinatorial Optimization. To appear. Also available from the authors' homepages.
3. [BF81] J. Beck and T. Fiala. "Integer making" theorems. Discrete Applied Mathematics, 3:1-8, 1981.
4. [Doe01] B. Doerr. Lattice approximation and linear discrepancy of totally unimodular matrices. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 119-125, 2001.
5. [DS03] B. Doerr and A. Srivastav. Multicolour discrepancies. Combinatorics, Probability and Computing, 12:365-399, 2003.
6. [dW71] D. de Werra. Equitable colorations of graphs. Rev. Française Informat. Recherche Opérationnelle, 5(Ser. R-3):3-8, 1971.
7. [GH62] A. Ghouila-Houri. Caractérisation des matrices totalement unimodulaires. C. R. Acad. Sci. Paris, 254:1192-1194, 1962.
8. [GKPS02] R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan. Dependent rounding in bipartite graphs. In Proc. IEEE Symposium on Foundations of Computer Science (FOCS), pages 323-332, 2002.
9. +99] V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In Annual ACM Symposium on Theory of Computing (STOC), pages 19-28, New York, 1999. ACM.
10. [HK56] 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.
11. +87] R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. V. Vazirani, and V. V. Vazirani. Global wire routing in two-dimensional arrays. Algorithmica, 2:113-129, 1987.
12. [PS97] A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Comput., 26:350-368, 1997.
13. [Rag88] P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci., 37:130-143, 1988.
14. [RT87] P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
15. [RT91] P. Raghavan and C. D. Thompson. Multiterminal global routing: a deterministic approximation scheme. Algorithmica, 6:73-82, 1991.
16. [Spe87] J. Spencer. Ten Lectures on the Probabilistic Method. SIAM, 1987.
17. [Sri01] A. Srinivasan. Distributions on level-sets with applications to approximations algorithms. In Proc. 41th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pages 588-597, 2001.
18. [SS96] A. Srivastav and P. Stangier. Algorithmic Chernoff-Hoeffding inequalities in integer programming. Random Structures & Algorithms, 8:27-58, 1996.