Randomized rounding without solving the linear program

We introduce a new technique called oblivious rounding a variant of randomized rounding that avoids the bottleneck of first solving the linear program. Avoiding this bottleneck yields more efficient algorithms and brings probabilistic methods to bear on a new class of problems. We give oblivious rounding algorithms that approximately solve general packing and covering problems, including a parallel algorithm to find sparse strategies for matrix games.

[1]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[2]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[3]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[4]  P. Raghavan.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[5]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[6]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[7]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[8]  Fillia Makedon,et al.  Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.

[9]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[11]  Noam Nisan,et al.  A parallel approximation algorithm for positive linear programming , 1993, STOC.

[12]  Philip N. Klein,et al.  Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..

[13]  N. Fisher,et al.  Probability Inequalities for Sums of Bounded Random Variables , 1994 .

[14]  I. Althöfer.  On sparse approximations to randomized strategies and convex combinations , 1994 .

[15]  R. Vohra,et al.  Linear programming relaxations, approximation algorithms and randomization: A unified view of covering problems , 1994 .

[16]  Richard J. Lipton,et al.  Simple strategies for large zero-sum games with applications to complexity theory , 1994, STOC '94.

[17]  Leonid Khachiyan,et al.  A sublinear-time randomized approximation algorithm for matrix games , 1995, Oper. Res. Lett..

[18]  Fillia Makedon,et al.  Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..

[19]  H. Lefmann,et al.  Computing sparse approximations deterministically , 1996 .