A fast approximation scheme for fractional covering problems with variable upper bounds

We present the first combinatorial approximation scheme for mixed positive packing and covering linear programs that yields a pure approximation guarantee. Our algorithm returns solutions that simultaneously satisfy general positive covering constraints and packing constraints that are variable upper bounds. The returned solution has positive linear objective function value at most 1 + ε times the optimal value.Our approximation scheme is based on Lagrangian-relaxation methods. Previous such approximation schemes for mixed packing and covering problems does not simultaneously satisfy packing and covering constraints exactly. We show how to exactly satisfy general positive covering constraints simultaneously with variable upper bounds.A natural set of problems that our work addresses are linear programs for various network design problems: generalized Steiner network, vertex connectivity, directed connectivity, capacitated network design, group Steiner forest. These are all NP-hard problems for which there are approximation algorithms that round the solution to the corresponding linear program. Solving the linear program is often the computational bottleneck in these problems, and thus a fast approximation scheme for the LP relaxation means faster approximation algorithms.For the special case of survivable network design, we introduce a new modification of the push-relabel maximum flow algorithm that allows us to perform each iteration in amortized O(m + n log n) time, instead of one maximum flow per iteration that is implied by the straight forward adaptation of our general algorithm. (m is the number of edges and n is the number of vertices in the network.) In conjunction with an observation that reduces the number of iterations to {log n for f0} constraint matrices, the modification allows us to obtain an algorithm that is faster than existing exact or approximate algorithms by a factor of at least O(m) and by a factor of O(m log n) if the number of demand pairs is Ω(n).

[1]  Santosh S. Vempala,et al.  Approximation algorithms for minimum-cost k-vertex connected subgraphs , 2002, STOC '02.

[2]  42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA , 2001, FOCS.

[3]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[4]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

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

[6]  Ulrich Derigs,et al.  Implementing Goldberg's max-flow-algorithm — A computational investigation , 1989, ZOR Methods Model. Oper. Res..

[7]  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..

[8]  Naveen Garg,et al.  Fast approximation algorithms for fractional Steiner forest and related problems , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

[10]  Leonid Khachiyan,et al.  Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..

[11]  Éva Tardos,et al.  Approximation Algorithms for a Directed Network Design Problem , 1999, IPCO.

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

[13]  Andrew V. Goldberg,et al.  An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow , 1998, IPCO.

[14]  D. Bienstock Experiments with a Network Design Algorithm Using -approximate Linear Programs , 1998 .

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

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

[17]  Tomasz Radzik Fast deterministic approximation for the multicommodity flow problem , 1995, SODA '95.

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

[19]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[20]  Neal E. Young,et al.  Sequential and parallel algorithms for mixed packing and covering , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

[22]  Dan Gusfield,et al.  Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..

[23]  G. F. J-SJ,et al.  A 2-approximation for Minimum Cost {0, 1, 2} Vertex Connectivity , 2001 .

[24]  Andrew V. Goldberg,et al.  On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.

[25]  Robert D. Carr,et al.  Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.

[26]  David P. Williamson On the design of approximation algorithms for a class of graph problems , 1993 .

[27]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

[28]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

[29]  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).

[30]  Kamal Jain,et al.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[31]  Kamal Jain A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 2001, Comb..

[32]  David P. Williamson,et al.  An iterative rounding 2-approximation algorithm for the element connectivity problem , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.