Fractional Packing of T-Joins

Authors:
Francisco Barahona
Affiliations:
-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2004

Citing 0
Cited 3

Fractional packing in ideal clutters

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
TSP on cubic and subcubic graphs

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
TSP tours in cubic graphs: beyond 4/3

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T-cut is equal to the value of a maximum fractional packing of T-joins. The Padberg--Rao algorithm finds a minimum capacity T-cut, but it does not produce a T-join packing. We present a polynomial combinatorial algorithm for finding an optimal T-join packing.