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

Mikita Hradovich Adam Kasperski Pawel Zielinski

Published in: CoRR (2016)

Keyphrases

interval data
polynomially solvable
np complete
special case
np hard
processing times
computationally efficient
scheduling problem
makespan minimization