Sequential and parallel algorithms for mixed packing and covering

We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (aka mixed packing and covering problems). For explicitly given problems, our fastest sequential algorithm returns a solution satisfying all constraints within a 1/spl plusmn//spl epsi/ factor in O(mdlog(m)//spl epsi//sup 2/) time, where m is the number of constraints and d is the maximum number of constraints any variable appears in. Our parallel algorithm runs in time polylogarithmic in the input size times /spl epsi//sup -4/ and uses a total number of operations comparable to the sequential algorithm. The main contribution is that the algorithms solve mixed packing and covering problems (in contrast to pure packing or pure covering problems, which have only "/spl les/" or only "/spl ges/" inequalities, but not both) and run in time independent of the so-called width of the problem.

[1]  J. Neumann,et al.  SOLUTIONS OF GAMES BY DIFFERENTIAL EQUATIONS , 1950 .

[2]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[3]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[4]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[5]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[6]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[7]  L. Khachiyan.  Convergence rate of the game processes for solving matrix games , 1977 .

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

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

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

[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]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

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

[15]  Leonid Khachiyan,et al.  An exponential-function reduction method for block-angular convex programs , 1995, Networks.

[16]  David R. Karger,et al.  Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows , 1995, STOC '95.

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

[18]  Leonid Khachiyan,et al.  Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ−2KNM) timetime , 1996, Math. Program..

[19]  Leonid Khachiyan,et al.  Coordination Complexity of Parallel Price-Directive Decomposition , 1996, Math. Oper. Res..

[20]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[21]  Philip N. Klein,et al.  On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms , 1999, SIAM J. Comput..

[22]  D. Bienstock.  Approximately solving large-scale linear programs. I. Strengthening lower bounds and accelerating co , 1999 .

[23]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[24]  Neal E. Young.  K-medians, facility location, and the Chernoff-Wald bound , 2000, SODA '00.

[25]  Jochen Könemann,et al.  Fast Combinatorial Algorithms for Packing and Covering Problems , 2000 .