Simple and fast reoptimizations for the Steiner tree problem
Escoffier B, Milanič M, Paschos VT (2007)
DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ.
Report
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Escoffier, Bruno;
Milanič, Martin;
Paschos, Vangelis Th.
Einrichtung
Erscheinungsjahr
2007
Page URI
https://pub.uni-bielefeld.de/record/2499308
Zitieren
Escoffier B, Milanič M, Paschos VT. Simple and fast reoptimizations for the Steiner tree problem. DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ; 2007.
Escoffier, B., Milanič, M., & Paschos, V. T. (2007). Simple and fast reoptimizations for the Steiner tree problem. DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ.
Escoffier, Bruno, Milanič, Martin, and Paschos, Vangelis Th. 2007. Simple and fast reoptimizations for the Steiner tree problem. DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ.
Escoffier, B., Milanič, M., and Paschos, V. T. (2007). Simple and fast reoptimizations for the Steiner tree problem. DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ.
Escoffier, B., Milanič, M., & Paschos, V.T., 2007. Simple and fast reoptimizations for the Steiner tree problem, DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ.
B. Escoffier, M. Milanič, and V.T. Paschos, Simple and fast reoptimizations for the Steiner tree problem, DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ, 2007.
Escoffier, B., Milanič, M., Paschos, V.T.: Simple and fast reoptimizations for the Steiner tree problem. DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ (2007).
Escoffier, Bruno, Milanič, Martin, and Paschos, Vangelis Th. Simple and fast reoptimizations for the Steiner tree problem. DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ, 2007.