On complexity, representation and approximation of integral multicommodity flows

https://doi.org/10.1016/S0166-218X(99)00133-XGet rights and content
Under an Elsevier user license
open archive

Abstract

The paper has two parts. In the algorithmic part integer inequality systems of packing types and their application to integral multicommodity flow problems are considered. We give 1−ε approximation algorithms using the randomized rounding/derandomization scheme provided that the components of the right-hand side vector (resp. the capacities) are in Ω−2logm) where m is the number of constraints (resp. the number of edges). In the complexity-theoretic part it is shown that the approximable instances above build hard problems. Extending a result of Garg et al. (Algorithmica 18 (1997) 3–20), the non approximability of the maximum integral multicommodity flow problem for trees with a large capacity function c∈Ω(logm), is proved. Furthermore, for every fixed non-negative integer K the problem with specified demand function rK is NP-hard even if c is any function polynomially bounded in n and if the problem with demand function r is fractionally solvable. For fractionally solvable multicommodity flow problems with nonplanar union of supply and demand graph the integrality gap is unbounded, while in the planar case Korach and Penn (Technical Report, Computer Science Department, Israel Institute of Technology, Haifa, 1989) could fix it to 1. Finally, an interesting relation between discrepancies of set systems and integral multicommodity flows with specified demands is discussed.

MSC

60C05
60E15
68Q25
90C35
05C85
68R10

Keywords

Derandomization
Integer programming
Integral multicommodity flows

Cited by (0)

Parts from Sections 2 and 4 of this paper appeared in preliminary form in the proceedings of the First Annual European Symposium on Algorithms (ESA’93), T. Lengauer (Ed.), Lecture Notes in Computer Science (726), Springer Verlag (1993), pp. 360–372.