Path packing and a related optimization problem

Natalia Vanetik ()
Additional contact information
Natalia Vanetik: Ben-Gurion University

Journal of Combinatorial Optimization, 2009, vol. 17, issue 2, No 5, 192-205

Abstract: 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.

Keywords: Path packing; Multiflow; K-clutter (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9107-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:17:y:2009:i:2:d:10.1007_s10878-007-9107-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9107-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().