Euclidean Steiner Minimum Trees: An Improved Exact Algorithm

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Standard

Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. / Winter, Pawel; Zachariasen, Martin.

I: NETWORKS, Bind 30, 1997, s. 149-166.

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Harvard

Winter, P & Zachariasen, M 1997, 'Euclidean Steiner Minimum Trees: An Improved Exact Algorithm', NETWORKS, bind 30, s. 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

Winter, Pawel ; Zachariasen, Martin. / Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. I: NETWORKS. 1997 ; Bind 30. s. 149-166.

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