|
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 www.cs.elte.hu/egres}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2005}, |
| NUMBER | = | {TR-2005-15} |