Abstract
Given an undirected graph G=(N,E), a subset T of its nodes and an undirected graph (T,S), G and (T,S) together are often called a network. A collection of paths in G whose end-pairs lie in S is called an integer multiflow. When these paths are allowed to have fractional weight, under the constraint that the total weight of the paths traversing a single edge does not exceed 1, we have a fractional multiflow in G. The problems of finding the maximum weight of paths with end-pairs in S over all fractional multiflows in G is called the fractional path packing problem.
In 1989, A. Karzanov had defined the fractionality of the fractional path packing problem for a class of networks {G,(T,S)} as the smallest natural D such that for any network from the class, the fractional path packing problem has a solution which becomes integer-valued when multiplied by D (see A. Karzanov in Linear Algebra Appl. 114–115:293–328, 1989). He proved that the fractional path packing problem has infinite fractionality outside a very specific class of networks, and conjectured that within this class, the fractionality does not exceed 4. A. Karzanov also proved that the fractionality of the path packing problem is at most 8 by studying the fractionality of the dual problem. Special cases of Karzanov’s conjecture were proved in or are implied by the works of L.R. Ford and D.R. Fulkerson, Y. Dinitz, T.C. Hu, B.V. Cherkassky, L. Lovãsz and H. Hirai. We prove Karzanov’s conjecture by showing that the fractionality of the path packing problem is at most 4. Our proof is stand-alone and does not rely on Karzanov’s results.
Similar content being viewed by others
References
Barsky E, Ilani H (2003) NP-hardness of one class of path packing problem. Manuscript
Cherkassky BV (1977) Solution of a problem on multicommodity flows in a network. Ekon Mat Metody 13:143–151
Dinic EA (1970) Algorithm for the solution of a problem of maximum flow in networks with power estimation. Sov Math Dokl 11:1277–1280 (in Russian)
Ford LR Jr, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399–404
Frank A (1990) Packing paths, circuits and cuts—a survey. In: Korte B, Lovãsz L, Prömel HJ, Schrijver A (eds) Paths, flows, and VLSI-layout. Springer, Berlin
Hirai H (2009) Tight spans of distances and the dual fractionality of undirected multiflow problems. J Comb Theory, Ser B 99:843–868
Hirai H (2010) Metric packing for K3 + K3. Combinatorica 30:295–326
Hu TC (1963) Multi-commodity network flows. Oper Res 11:344–360
Ilani H, Korach E, Lomonosov M (2000) On extremal multiflows. J Comb Theory, Ser B 79:183–210
Karzanov A (1989) Polyhedra related to undirected multicommodity flows. Linear Algebra Appl 114–115:293–328
Karzanov A, Lomonosov M (1978) Systems of flows in undirected networks. In: Math programming. Problems of social and economical systems. Operations research models. Work collection, Moscow, vol 1, pp 59–66 (in Russian)
Lomonosov M (1985) Combinatorial approaches to multiflow problems. Appl Discrete Math 11(1):1–93
Lomonosov M (2004) On return path packing. Eur J Comb 25(1):35–53
Lovãsz L (1976) On some connectivity properties of Eulerian graphs. Acta Math Acad Sci Hung 28:129–138
Vanetik N (2009) Path packing and a related optimization problem. J Comb Optim 17(2):192–205
Author information
Authors and Affiliations
Corresponding author
Additional information
The author expresses her deepest gratitude to Prof. Yefim Dinitz and Prof. Mikhail Klin for their help with this manuscript and the Lynn and William Fraenkel Center for Computer Science for partially supporting this work.
Rights and permissions
About this article
Cite this article
Vanetik, N. On the fractionality of the path packing problem. J Comb Optim 24, 526–539 (2012). https://doi.org/10.1007/s10878-011-9405-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9405-3