Simple and fast reoptimizations for the Steiner tree problem

Escoffier B, Milanivc M, Paschos VT (2007)
DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ.

Report | Published | English

No fulltext has been uploaded

Author
; ;
Publishing Year
PUB-ID

Cite this

Escoffier B, Milanivc 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., Milanivc, 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, B., Milanivc, 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., Milanivc, 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. Milanivc, 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., Milanivc, 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, B., Milanivc, M., and Paschos, V.Th. Simple and fast reoptimizations for the Steiner tree problem. DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, NJ, 2007.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar