On calculation of the stability radius for a minimum spanning tree
We consider a minimum spanning tree problem in the situation where weights of edges are exposed to independent perturbations. We study a quantitative characteristic of stability for a given optimal solutions of the problem. The characteristic is called the stability radius and defined as the limit l...
Main Authors: | Yauheni D. Zhyvitsa, Kiril G. Kuzmin |
---|---|
Format: | Article |
Language: | Belarusian |
Published: |
Belarusian State University
2017-12-01
|
Series: | Журнал Белорусского государственного университета: Математика, информатика |
Subjects: | |
Online Access: | https://journals.bsu.by/index.php/mathematics/article/view/735 |
Similar Items
-
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01) -
The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01) -
Spanning trees with small diameters
by: Mikio Kano, et al.
Published: (2020-01-01) -
Spanning tree modulus: deflation and a hierarchical graph structure
by: Clemens, Jason
Published: (2018) -
An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem
by: Tamer F. Abdelmaguid
Published: (2018-09-01)