Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- 979 Downloads
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.
AMS subject classification90 C 10
Unable to display preview. Download preview PDF.
- D. Angluin andL. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings,Journal of Computer and System Sciences,19, 155–193.Google Scholar
- R. M. Karp, Reducibility among combinatorial problems,Complexity of Computer Computations, (ed. R. N. Miller, J. W. Thatcher),Plenum Press, New York, (1972), 85–104.Google Scholar
- 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.Google Scholar
- P. Raghavan andC. D. Thompson, Randomized Routing in Gate-Arrays,CSD/84/202, Computer Science Division, UC Berkeley, (1984).Google Scholar
- 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.Google Scholar
- P. Raghavan, Randomized Rouding and Discrete Ham-Sandwiches: Provably Good Algorithms for Routing and Packing Problems,PhD Thesis, Computer Science Division, UC Berkeley, (1986).Google Scholar