An algorithm for inverse minimum spanning tree problem

被引：31
|
作者：
Zhang, JH
Xu, SJ
Ma, ZF
机构：
[1] CITY UNIV HONG KONG,DEPT MATH,HONG KONG,HONG KONG
[2] RUTGERS STATE UNIV,RUTCOR,NEW BRUNSWICK,NJ 08903
[3] ACAD SINICA,INST SYST SCI,BEIJING 100080,PEOPLES R CHINA
来源：
OPTIMIZATION METHODS & SOFTWARE | 1997年 / 8卷 / 01期
关键词：
spanning tree; inverse problem; minimum covering set; bipartite graph;
D O I：
10.1080/10556789708805666
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper we consider an inverse minimum spanning tree problem in which we wish to change the original weights of the edges in a graph as little as possible so that a given spanning tree of the graph can become the minimum spanning tree. An algorithm is proposed which can solve the problem in polynomial time. The algorithm is a combinatorial method that uses the minimum covering problem as its main subproblem. An example is included to illustrate the method.
引用
收藏
页码：69 / 84
页数：16
相关论文
共 50 条
  • [1] A faster algorithm for the inverse spanning tree problem
    Ahuja, RK
    Orlin, JB
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 34 (01): : 177 - 193
  • [2] On the inverse minimum spanning tree problem with minimum number of perturbed edges
    Bangyi Li
    Zhaohan Sheng
    [J]. Journal of Systems Science and Systems Engineering, 2003, 12 (3) : 350 - 359
  • [3] ON THE INVERSE MINIMUM SPANNING TREE PROBLEM WITH MINIMUM NUMBER OF PERTURBED EDGES
    Bangyi LI Zhaohan SHENGCollege of Economics and Management
    [J]. Journal of Systems Science and Systems Engineering, 2003, (03) : 350 - 359
  • [4] A genetic algorithm for the Capacitated Minimum Spanning Tree problem
    de Lacerda, Estefane George Macedo
    de Medeiros, Manoel Firmino
    [J]. 2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 725 - +
  • [5] A new algorithm for the minimum spanning tree verification problem
    Williamson, Matthew
    Subramani, K.
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2015, 61 (01) : 189 - 204
  • [6] A minimum spanning tree algorithm with Inverse Ackermann type complexity
    Chazelle, B
    [J]. JOURNAL OF THE ACM, 2000, 47 (06) : 1028 - 1047
  • [7] A Distributed Parallel Algorithm for the Minimum Spanning Tree Problem
    Mazeev, Artem
    Semenov, Alexander
    Simonov, Alexey
    [J]. PARALLEL COMPUTATIONAL TECHNOLOGIES, PCT 2017, 2017, 753 : 101 - 113
  • [8] A new algorithm for the minimum spanning tree verification problem
    Matthew Williamson
    K. Subramani
    [J]. Computational Optimization and Applications, 2015, 61 : 189 - 204
  • [9] An Algorithm for the Minimum Spanning Tree Problem with Uncertain Structures
    Hernandes, F.
    Lourenco, M. H. R. S.
    [J]. IEEE LATIN AMERICA TRANSACTIONS, 2015, 13 (12) : 3885 - 3889
  • [10] A memetic algorithm for the biobjective minimum spanning tree problem
    Rocha, Daniel A. M.
    Gouvea Goldbarg, Elizabeth F.
    Goldbarg, Marco Cesar
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2006, 3906 : 222 - 233
12345