Packing multiway cuts in capacitated graphs

MaRDI QIDQ4633919zbMATH OpenFDO

Authors Siddharth Barman, Shuchi Chawla

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496884

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Multiway cuts in node weighted graphs
• Algorithm Theory - SWAT 2004
• Packing cuts in undirected graphs
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 1775387

Cited in

(2)

• Directed cut transversal packing for source-sink connected graphs
• Packing cuts in undirected graphs

This page was built for publication: Packing multiway cuts in capacitated graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633919)