Minimum \(k\) arborescences with bandwidth constraints
type: Item
instance of: scholarly article
title: Minimum \(k\) arborescences with bandwidth constraints
zbMATH Open document ID: 1053.05109
author: Xiaotie Deng
author: Lusheng Wang
author: Mao-Cheng Cai
published in: Algorithmica
publication date: 2004-09-22T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 2101911
zbMATH Keywords: digraph
zbMATH Keywords: arborescence
zbMATH Keywords: matroid
zbMATH Keywords: polymatroid intersection
zbMATH Keywords: maximum flow
zbMATH Keywords: algorithm complexity
MaRDI profile type: Publication
full work available at URL: s00453-003-1054-1
OpenAlex ID: W2166763236
cites work: Routing to Multiple Destinations in Computer Networks
cites work: Q3292914
cites work: The directed subgraph homeomorphism problem
cites work: A weighted matroid intersection algorithm
cites work: Geometric algorithms and combinatorial optimization
cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
cites work: Q4136942
cites work: On two minimax theorems in graph
cites work: On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
cites work: Blocking, antiblocking, and pairs of matroids and polymatroids
DOI: 10.1007/S00453-003-1054-1
description: scientific article; zbMATH DE number 2101911