Fractional Packing ofT-Joins

DOI10.1137/S0895480102409619zbMath1101.90054MaRDI QIDQ4652614

Francisco Barahona

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Stronger bounds and faster algorithms for packing in generalized kernel systems ⋮ Cubic TSP: A 1.3-Approximation ⋮ Fractional packing in ideal clutters ⋮ The traveling salesman problem on cubic and subcubic graphs ⋮ TSP on Cubic and Subcubic Graphs ⋮ TSP Tours in Cubic Graphs: Beyond 4/3 ⋮ Packing in generalized kernel systems: a framework that generalizes packing of branchings

This page was built for publication: Fractional Packing ofT-Joins