The robust recoverable spanning tree problem with interval costs is polynomially solvable
Data Structures and Algorithms
2016-03-08 v2
Abstract
In this paper the robust recoverable spanning tree problem with interval edge costs is considered. The complexity of this problem has remained open to date. It is shown that the problem is polynomially solvable, by using an iterative relaxation method. A generalization of this idea to the robust recoverable matroid basis problem is also presented. Polynomial algorithms for both robust recoverable problems are proposed.
Cite
@article{arxiv.1602.07422,
title = {The robust recoverable spanning tree problem with interval costs is polynomially solvable},
author = {Mikita Hradovich and Adam Kasperski and Pawel Zielinski},
journal= {arXiv preprint arXiv:1602.07422},
year = {2016}
}