Recoverable robust spanning tree problem under interval uncertainty representations

Abstract

This paper deals with the recoverable robust spanning tree problem under interval uncertainty representations. A strongly polynomial time, combinatorial algorithm for the recoverable spanning tree problem is first constructed. This problem generalizes the incremental spanning tree problem, previously discussed in literature. The algorithm built is then… (More)
DOI: 10.1007/s10878-016-0089-6

Topics

9 Figures and Tables

Slides referencing similar topics