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

@article{Aron2004OnTC,
  title={On the complexity of the robust spanning tree problem with interval data},
  author={Ionut D. Aron and Pascal Van Hentenryck},
  journal={Oper. Res. Lett.},
  year={2004},
  volume={32},
  pages={36-40}
}
This paper studies the complexity of the robust spanning tree problem with interval data (RSTID). It shows that the problem is NP-complete, settling the conjecture of Kouvelis and Yu, and that it remains so for complete graphs or when the intervals are all [0; 1]. These results indicate that the di8culty of RSTID stems from both the graph topology and the structure of the cost intervals, suggesting new directions for search algorithms. c © 2003 Elsevier B.V. All rights reserved. 
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS