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

Mikita Hradovich Adam Kasperski Pawel Zielinski

Published in: Optim. Lett. (2017)

Keyphrases

interval data
polynomially solvable
special case
np hard
computationally efficient
np complete
partial occlusion
processing times