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

Operations Research Letters

Volumn 32, Issue 1, 2004, Pages 36-40

  Aron, Ionuţ D ^a,b   Van Hentenryck, Pascal ^a  

^a Brown Univerity   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Interval data; Robust optimization; Robust spanning tree; Uncertainty

Indexed keywords

ALGORITHMS; OPTIMIZATION; TREES (MATHEMATICS);

ROBUST SPANNING TREES;

OPERATIONS RESEARCH;

EID: 0142029538     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00058-0     Document Type: Article

References (20)

1. Amoia A., Cottafava G. Invariance properties of central trees. IEEE Trans. Circuit Theory. CT-18:1971;465-467.
2. I. Aron, P. Van Hentenryck, A constraint satisfaction approach to the robust spanning tree problem with interval data, in: Proceedings of the 18th Conference on UAI, Edmonton, Canada, August 1-4, 2002.
3. D. Bertsimas, M. Sim, Robust discrete optimization, Working Paper, Operations Research Center, MIT, January 2002.
4. S. Bezrukov, F. Kaderali, W. Poguntke, On central spanning trees of a graph, in: Lecture Notes in Computer Science, Vol. 1120, Springer, Berlin, 1996, pp. 53-58.
5. Deo N. A central tree. IEEE Trans. Circuit Theory. CT-13:1966;439-440. correspondence.
6. Hakimi S.L. On trees of a graph and their generation. J. Franklin Inst. 272:1961;347-359.
7. F. Kaderali, A counterexample to the algorithm of Amoia and Cottafava for finding central trees, Technical Report FB 19, TH Darmstadt, June 1973, Preprint.
8. Kishi G., Kajitani Y. Maximally distant trees and principal partition of a linear graph. IEEE Trans. Circuit Theory. CT-16:1969;323-330.
9. Kouvelis P., Yu G. Robust Discrete Optimization and its Applications. 1997;Kluwer Academic, Dordrecht.
10. Kozina G., Perepelista V. Interval spanning tree problem. solvability and computational complexity Interval Comput. 1:1994;42-50.
11. Y.Y. Lee, Use of compound matrices in topological analysis, Master's Thesis, Kansas State University, Manhatten, KS, 1968.
12. Malik N. On Deo's central tree concept. IEEE Trans. Circuit Theory. CT-15:1968;283-284. correspondence.
13. N. Malik, Y.Y. Lee, Finding trees and signed tree pairs by the compound method, in Tenth Midwest Symposium on Circuit Theory, 1967, pp. VI-5-1-VI-5-11.
14. Mayeda W., Seshu S. Generation of trees without duplications. IEEE Trans. Circuit Theory. CT-12:1965;181-185.
15. R. Montemanni, L. Gambardella, A. Rizzoli, A. Donati, A branch and bound algorithm for the robust spanning tree problem with interval data, Technical Report No. IDSIA-10-02, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, 2002.
16. S. Shinoda, T. Kawamoto, Central trees and critical sets, in: D.E. Kirk (Ed.), Proceedings of the 14th Asilomar Conference on Circuit, Systems and Computers, Vol. 108, Pacific Grove, California, 1980, pp. 183-187.
17. S. Shinoda, T. Kawamoto, On central trees of a graph, in: Lecture Notes in Computer Science, Vol. 108, Springer, Berlin, 1981, pp. 137-151.
18. S. Shinoda, K. Saishu, Conditions for an incidence set to be a central tree, Technical Report CAS80-6, Institute of Electrical and Communication Engineering, Japan, 1980.
19. Thulasiraman K., Swamy M.N.S. Graphs: Theory And Algorithms. 1992;Wiley, New York. ISBN 0-471-51356-3.
20. Yaman H., Karasan O., Pinar M. The robust spanning tree problem with interval data. Oper. Res. Lett. 29:2001;31-40.