A greedy algorithm for multicut and integral multiflow in rooted trees

被引：10
|
作者：
Costa, MC
Létocart, L
Roupin, F
机构：
[1] CNAM, CEDRIC, F-75141 Paris 03, France
[2] CNAM, IIE, CEDRIC, F-91025 Evry, France
来源：
OPERATIONS RESEARCH LETTERS | 2003年 / 31卷 / 01期
关键词：
maximum integral multiflow; minimum multicut; duality; rooted tree;
D O I：
10.1016/S0167-6377(02)00184-0
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We present an O(min(Kn,n(2))) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：21 / 27
页数：7
相关论文
共 50 条
12345