Improved parallel approximation of a class of integer programming problems
- 1 April 1997
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 17 (4) , 449-462
- https://doi.org/10.1007/bf02523683
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functionsAlgorithmica, 1996
- Randomized algorithms and pseudorandom numbersJournal of the ACM, 1993
- Monte Carlo simulations: Hidden errors from ‘‘good’’ random number generatorsPhysical Review Letters, 1992
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphsIEEE Transactions on Information Theory, 1992
- Simple Constructions of Almost k‐wise Independent Random VariablesRandom Structures & Algorithms, 1992
- Simulating (log c n )-wise independence in NCJournal of the ACM, 1991
- Optima of dual integer linear programsCombinatorica, 1988
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952