Cieslik, D., Dress, A., Huber, K. T. and Moulton, V.
ORCID: https://orcid.org/0000-0001-9371-6435
(2002)
Embedding complexity and discrete optimization I: A new divide and conquer approach to discrete optimization.
Annals of Combinatorics, 6 (3-4).
pp. 257-273.
ISSN 0218-0006
Cieslik, D., Dress, A., Huber, K. T. and Moulton, V. (2002) Embedding complexity and discrete optimization II: A dynamical programming approach to the Steiner-Tree Problem. Annals of Combinatorics, 6 (3-4). pp. 275-283. ISSN 0218-0006