On weighted multiway cuts in trees
type: Item
instance of: scholarly article
title: On weighted multiway cuts in trees
zbMATH Open document ID: 0805.05016
DOI: 10.1007/BF01581691
published in: Mathematical Programming. Series A. Series B
publication date: 1994-09-26T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 644745
zbMATH Keywords: Menger's theorem
zbMATH Keywords: duality in linear programming
zbMATH Keywords: min-max theorem
zbMATH Keywords: multiway cut problem
zbMATH Keywords: trees
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: dynamic programming
author: Péter L. Erdős
author: László A. Székely
MaRDI profile type: Publication
cites work: On the multiway cut polyhedron
cites work: Q4035360
cites work: The Complexity of Multiterminal Cuts
cites work: Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
cites work: Q4040221
cites work: Decompositions of leaf-colored binary trees
full work available at URL: https://doi.org/10.1007/bf01581691
OpenAlex ID: W2073609181
description: scientific article; zbMATH DE number 644745