Packing cuts in undirected graphs

DOI10.1002/net.20008zbMath1044.05063OpenAlexW2137293391MaRDI QIDQ4812395

Alberto Caprara, Romeo Rizzi, Alessandro Panconesi

Publication date: 20 August 2004

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20008

zbMATH Keywords

complexityapproximationpackingindependent setlinear programming relaxationedge-disjoint cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Approximability of Packing Disjoint Cycles ⋮ A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs

Cites Work

• Geometric algorithms and combinatorial optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing cuts in undirected graphs