On calculation of the stability radius for a minimum spanning tree

MaRDI QIDQ6938414zbMATH OpenFDO

Authors Evgeniĭ Dmitrievich Zhivitsa, Kirill Gennad'evich Kuz'min

Publication date 25 August 2025

Published in Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://journals.bsu.by/index.php/mathematics/article/view/735

zbMATH Keywords

minimum spanning tree problemsecond-best spanning treesensitivity analysis of solutionsstability radius

Mathematics Subject Classification ID

Trees (05C05) Programming involving graphs or networks (90C35)

Cites work

• A general approach to the calculation of stability radii for the max-cut problem with multiple criteria
• Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
• Finding the \(k\) smallest spanning trees
• On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization
• Quantitative stability analysis for vector problems of 0-1 programming
• Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time
• Stability analysis of the minimum spanning tree problem

This page was built for publication: On calculation of the stability radius for a minimum spanning tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938414)