Abstract
Let G be a supply graph, with the node set N and edge set E, and (T,S) be a demand graph, with T⊆N, S∩E=∅. Observe paths whose end-vertices form pairs in S (called S-paths). The following path packing problem for graphs is fundamental: what is the maximal number of S-paths in G? In this paper this problem is studied under two assumptions: (a) the node degrees in N∖T are even, and (b) any three distinct pairwise intersecting maximal stable sets A,B,C of (T,S) satisfy A∩B=B∩C=A∩C (this condition was defined by A. Karzanov in Linear Algebra Appl. 114–115:293–328, 1989). For any demand graph violating (b) the problem is known to be NP-hard even under (a), and only a few cases satisfying (a) and (b) have been solved. In each of the solved cases, a solution and an optimal dual object were defined by a certain auxiliary “weak” multiflow optimization problem whose solutions supply constructive elements for S-paths and concatenate them into an S-path packing by a kind of matching.
In this paper the above approach is extended to all demand graphs satisfying (a) and (b), by proving existence of a common solution of the S-path packing and its weak counterpart. The weak problem is very interesting for its own sake, and has connections with such topics as Mader’s edge-disjoint path packing theorem and b-factors in graphs.
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 (in Russian)
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
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. Mathematical programming. Problems of social and economical systems. Operations research models. Work collection. Issue 1, Moscow, pp 59–66 (in Russian)
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 Akad Sci Hung 28:129–138
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Vanetik, N. Path packing and a related optimization problem. J Comb Optim 17, 192–205 (2009). https://doi.org/10.1007/s10878-007-9107-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9107-z