On the complexity of the robust spanning tree problem with interval data.

Ionut D. Aron Pascal Van Hentenryck

Published in: Oper. Res. Lett. (2004)

Keyphrases

interval data
minmax regret
shortest path problem
data clustering
temporal data
multivariate data
shortest path
data sets
face recognition
multi objective
cost function
np hard
scheduling problem
worst case
markov chain
visual information