Euclidean Steiner Minimum Trees: An Improved Exact Algorithm
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. / Winter, Pawel; Zachariasen, Martin.
In: NETWORKS, Vol. 30, 1997, p. 149-166.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
Winter, P & Zachariasen, M 1997, 'Euclidean Steiner Minimum Trees: An Improved Exact Algorithm', NETWORKS, vol. 30, pp. 149-166.
APA
Winter, P., & Zachariasen, M. (1997). Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. NETWORKS, 30, 149-166.
Vancouver
Winter P, Zachariasen M. Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. NETWORKS. 1997;30:149-166.
Author
Bibtex
@article{057ec9e074cb11dbbee902004c4f4f50,
title = "Euclidean Steiner Minimum Trees: An Improved Exact Algorithm",
author = "Pawel Winter and Martin Zachariasen",
year = "1997",
language = "English",
volume = "30",
pages = "149--166",
journal = "NETWORKS",
publisher = "Wiley",
}
RIS
TY - JOUR
T1 - Euclidean Steiner Minimum Trees: An Improved Exact Algorithm
AU - Winter, Pawel
AU - Zachariasen, Martin
PY - 1997
Y1 - 1997
M3 - Journal article
VL - 30
SP - 149
EP - 166
JO - NETWORKS
JF - NETWORKS
ER -
ID: 225987