Probabilistic construction of deterministic algorithms: Approximating packing integer programs
- 31 October 1988
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 37 (2), 130-143
- https://doi.org/10.1016/0022-0000(88)90003-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987
- A decomposition algorithm for circuit routingPublished by Springer Nature ,1985
- Six standard deviations sufficeTransactions of the American Mathematical Society, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- “Integer-making” theoremsDiscrete Applied Mathematics, 1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Balancing families of setsJournal of Combinatorial Theory, Series A, 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
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952