Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
We study the relation between a class of 0–1 integer linear programs and their rational relaxations. We give a randomized algorithm for transforming an optimal solution of a relaxed problem into a provably good solution for the 0–1 problem. Our technique can be a of extended to provide bounds on the disparity between the rational and 0–1 optima for a given problem instance.
- Aharoni, R., Erdős, P., Linial, N. (1985) Dual Integer Linear Programs and the Relationship between their Optima. Proceedings of the Seventeenth ACM Symposium on Theory of Computing. ACM, New York, pp. 476-483 CrossRef
- D. Angluin andL. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings,Journal of Computer and System Sciences,19, 155–193.
- Chernoff, H. (1952) A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations. Annals of Math. Stat. 23: pp. 493-509
- Even, S., Itai, A., Shamir, A. (1976) On the complexity of timetable and multi-commodity flow problems. SIAM Journal on Computing 5: pp. 691-703 CrossRef
- Füredi, Z. (1981) Maximum degree and fractional matchings in uniform hypergraphs. Combinatorica 1: pp. 155-162
- Hoeffding, W. (1956) On the distribution of the number of successes independent trials. Annals of Math. Stat. 27: pp. 713-721
- Hu, T. C., Shing, M. T. (1985) A Decomposition Algorithm for Circuit Routing. Mathematical Programming Study 24: pp. 87-103
- Karmarkar, N. (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4: pp. 373-396 CrossRef
- Karp, R. M. Reducibility among combinatorial problems. In: Miller, R. N., Thatcher, J. W. eds. (1972) Complexity of Computer Computations. Plenum Press, New York, pp. 85-104
- R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. Vazirani andV. Vazirani Global Wire Routing in Two-Dimensional Arrays,Proc. 24th Annual Symp. on Foundations of Computer Science, (1983), 453–459.
- Lovász, L. (1975) On the ratio of optimal and fractional covers. Discrete Mathematics 13: pp. 383-390 CrossRef
- Malhotra, V. M., Kumar, M. P., Maheshwari, S. N. (1978) AnO(|V|3) algorithm for finding maximum flows in networks. Information Processing Letters 7: pp. 277-278 CrossRef
- P. Raghavan andC. D. Thompson, Randomized Routing in Gate-Arrays,CSD/84/202, Computer Science Division, UC Berkeley, (1984).
- P. Raghavan andC. D. Thompson, Provably Good Routing in Graphs: Regular Arrays,Proceedings of the Seventeenth ACM Symposium on Theory of Computing, ACM, New York, (1985), 79–87.
- P. Raghavan, Randomized Rouding and Discrete Ham-Sandwiches: Provably Good Algorithms for Routing and Packing Problems,PhD Thesis, Computer Science Division, UC Berkeley, (1986).
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Volume 7, Issue 4 , pp 365-374
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- 90 C 10
- Industry Sectors