Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- 1 December 1987
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 7 (4) , 365-374
- https://doi.org/10.1007/bf02579324
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A decomposition algorithm for circuit routingPublished by Springer Nature ,1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Maximum degree and fractional matchings in uniform hypergraphsCombinatorica, 1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- On the Distribution of the Number of Successes in Independent TrialsThe Annals of Mathematical Statistics, 1956
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952