Alternating paths revisited IV: packings and 2-packings of A-paths

Gyula Pap


We construct a combinatorial algorithm to find a maximum packing of fully node-disjoint A-paths. In doing this, we discover relations with fractional packings, 2-packings, and b-packings.

Bibtex entry:

AUTHOR = {Pap, Gyula},
TITLE = {Alternating paths revisited {IV}: packings and 2-packings of {$A$}-paths},
NOTE= {{\tt}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2005},
NUMBER = {TR-2005-15}

Last modification: 13.3.2018. Please email your comments to Tamás Király!