A greedy algorithm for multicut and integral multiflow in rooted trees
type: Item
instance of: scholarly article
title: A greedy algorithm for multicut and integral multiflow in rooted trees
zbMATH Open document ID: 1013.90130
DOI: 10.1016/S0167-6377(02)00184-0
author: Marie-Christine Costa
author: L. Létocart
author: Frédéric Roupin
published in: Operations Research Letters
publication date: 2003-05-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1903523
zbMATH Keywords: maximum integral multiflow
zbMATH Keywords: minimum multicut
zbMATH Keywords: duality
zbMATH Keywords: rooted tree
MaRDI profile type: Publication
cites work: The Complexity of Multiterminal Cuts
cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
cites work: Primal-dual approximation algorithms for integral flow and multicut in trees
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
description: scientific article; zbMATH DE number 1903523