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 条
  • [21] Approximating generalized multicut on trees
    Zhang, Peng
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 799 - 808
  • [22] A greedy algorithm estimating the height of random trees
    Luczak, T
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (02) : 318 - 329
  • [23] Counting Embeddings of Rooted Trees into Families of Rooted Trees
    Gittenberger, Bernhard
    Golebiewski, Zbigniew
    Larcher, Isabella
    Sulkowska, Malgorzata
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (03):
  • [24] Approximation algorithms for generalized multicut in trees
    Zhang, Peng
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2008, 45 (07): : 1195 - 1202
  • [25] Parameterized complexity of multicut in weighted trees
    Galby, Esther
    Marx, Daniel
    Schepper, Philipp
    Sharma, Roohani
    Tale, Prafullkumar
    THEORETICAL COMPUTER SCIENCE, 2023, 978
  • [26] An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees
    Jansson, Jesper
    Rajaby, Ramesh
    Sung, Wing-Kin
    ALGORITHMS FOR COMPUTATIONAL BIOLOGY (ALCOB 2017), 2017, 10252 : 115 - 126
  • [27] An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees
    Jansson, Jesper
    Rajaby, Ramesh
    Sung, Wing-Kin
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2019, 26 (09) : 893 - 907
  • [28] Parameterized Complexity of Weighted Multicut in Trees
    Galby, Esther
    Marx, Daniel
    Philipp, Schepper
    Sharma, Roohani
    Tale, Prafullkumar
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022), 2022, 13453 : 257 - 270
  • [29] Max-multiflow/min-multicut for G plus H series-parallel
    Cornaz, Denis
    DISCRETE MATHEMATICS, 2011, 311 (17) : 1957 - 1967
  • [30] An approximation algorithm for the K -prize-collecting multicut problem in trees with submodular penalties
    Liu, Xiaofei
    Li, Weidong
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2024, 34 (03) : 193 - 210
12345