On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem

Network design problems, such as generalizations of the Steiner Tree Problem, can be cast as edge-cost-flow problems (a.k.a. fixed-charge flows). We prove a hardness result for the Minimum Edge Cost Flow Problem (MECF). Using the one-round two-prover scenario, we prove that MECF in directed graphs does not admit a \( 2^{log^{1 - \varepsilon } n} \) -ratio approximation, for every constant ɛ > 0, unless NP ⊆ DTIME(n ^polylogn). A restricted version of MECF, called Infinite Capacity MECF (ICF), is defined as follows: (i) all edges have infinite capacity, (ii) there are multiple sources and sinks, where flow can be delivered from every source to every sink, (iii) each source and sink has a supply amount and demand amount, respectively, and (iv) the required total flow is given as part of the input. The goal is to find a minimum edge-cost flow that meets the required total flow while obeying the demands of the sinks and the supplies of the sources. We prove that directed ICF generalizes the Covering Steiner Problem. We also show that the undirected version of ICF generalizes several network design problems, such as: Steiner Tree Problem, k-MST, Point-to-point Connection Problem, and the generalized Steiner Tree Problem. An O(log x)-approximation algorithm for undirected ICF is presented, where x denotes the required total flow. We also present a bi-criteria approximation algorithm for directed ICF. The algorithm for directed ICF finds a flow that delivers half the required flow at a cost that is at most O(n ^ɛ/ɛ⁵) times bigger than the cost of an optimal flow. The running time of the algorithm for directed ICF is O(x ^2/ɛ · n ^1+1/ɛ). Finally, randomized approximation algorithms for the Covering Steiner Problem in directed and undirected graphs are presented. The algorithms are based on a randomized reduction to a problem called 1/2-Group Steiner. This reduction can be derandomized to yield a deterministic reduction. In directed graphs, the reduction leads to a first non-trivial approximation algorithm for the Covering Steiner Problem. In undirected graphs, the resulting ratio matches the best ratio known [KRS01], via a much simpler algorithm.

Authors and Affiliations

1. Dept. of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv, 69978, Israel

   Guy Even

2. Computer Sciences Department, Rutgers University, Camden

   Guy Kortsarz

3. Computer Science Dept., Technische Universität Wien, A-1040, Wien, Austria

   Wolfgang Slany

Editors and Affiliations

1. Department of Computer Science and Applied Mathematics, University of Kuopio, P.O. Box 1627, 70211, Kuopio, Finland

   Martti Penttonen

2. BRICS, University of Aarhus, Department of Computer Science, NY Munkegade, 8000, Aarhus C, Denmark

   Erik Meineche Schmidt

Reprints and permissions

© 2002 Springer-Verlag Berlin Heidelberg

Policies and ethics