Minimum multiway cuts in trees

DOI10.1016/S0166-218X(98)00049-3zbMath0910.90261OpenAlexW2017232591MaRDI QIDQ1270773

László A. Székely, Péter L. Erdős, András Frank

Publication date: 19 April 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

lower boundsminimum cardinality of a multiway cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Mean isoperimetry with control on outliers: exact and approximation algorithms ⋮ On a bidirected relaxation for the MULTIWAY CUT problem

Cites Work

• On weighted multiway cuts in trees
• Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
• On the multiway cut polyhedron
• On some connectivity properties of Eulerian graphs
• The Complexity of Multiterminal Cuts
• Nonlinear formulations and improved randomized approximation algorithms for multicut problems
• Unnamed Item

This page was built for publication: Minimum multiway cuts in trees