Minimum k arborescences with bandwidth constraints

doi:10.1007/s00453-003-1054-1

	Minimum k arborescences with bandwidth constraints
	Cai, MC ; Deng, XT ; Wang, LS
刊名	ALGORITHMICA
	2004-04-01
卷号	38 期号:4 页码:529-537
关键词	digraph arborescence matroid polymatroid polymatroid intersection maximum flow algorithm and complexity
ISSN号	0178-4617
DOI	10.1007/s00453-003-1054-1
英文摘要	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.
WOS研究方向	Computer Science ; Mathematics
语种	英语
出版者	SPRINGER-VERLAG
WOS记录号	WOS:000188848500002
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/956]
专题	中国科学院数学与系统科学研究院
通讯作者	Cai, MC
作者单位	1.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China 2.City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
推荐引用方式 GB/T 7714	Cai, MC,Deng, XT,Wang, LS. Minimum k arborescences with bandwidth constraints[J]. ALGORITHMICA,2004,38(4):529-537.
APA	Cai, MC,Deng, XT,&Wang, LS.(2004).Minimum k arborescences with bandwidth constraints.ALGORITHMICA,38(4),529-537.
MLA	Cai, MC,et al."Minimum k arborescences with bandwidth constraints".ALGORITHMICA 38.4(2004):529-537.