An algorithm for inverse minimum spanning tree problem

An algorithm for inverse minimum spanning tree problem

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 po...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization methods & software 1997-01, Vol.8 (1), p.69-84
Hauptverfasser: Zhang, Jianzhong, Xu, Shaoji, Ma, Zhongfan
Format: Artikel
Sprache:eng
Schlagworte:
Bipartite Graph
Inverse Problem
Minimum Covering Set
Spanning Tree
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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
ISSN:1055-6788
1029-4937
DOI:10.1080/10556789708805666