# The recoverable robust spanning tree problem with interval costs is polynomially solvable

> Research article (Optimization Letters, 2016) · cited 19× · AI/ML

**Wikidata**: [openalex:W2469064012](https://www.wikidata.org/wiki/openalex:W2469064012)  
**Source**: https://4ort.xyz/entity/the-recoverable-robust-spanning-tree-problem-with-interval-costs-is-polynomially-solvable