Minimum k arborescences with bandwidth constraints

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

10 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)529-537
Journal / PublicationAlgorithmica (New York)
Volume38
Issue number4
Publication statusPublished - Jan 2004

Abstract

Let G =(V,A) be a digraph with source r. A weight function w and bandwidth constraint function b (positive integer) on A are given. We present algorithms for finding k r-arborescences in G with minimum total weight and with bandwidth constraints. © 2003 Springer-Verlag New York Inc.

Research Area(s)

  • Algorithm and complexity, Arborescence, Digraph, Matroid, Maximum flow, Polymatroid, Polymatroid intersection

Citation Format(s)

Minimum k arborescences with bandwidth constraints. / Cai, Mao-Cheng; Deng, Xiaotie; Wang, Lusheng.
In: Algorithmica (New York), Vol. 38, No. 4, 01.2004, p. 529-537.

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review