Concatenation-Based Greedy Heuristic for the Euclidean Steiner Tree Problem

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

Concatenation-Based Greedy Heuristic for the Euclidean Steiner Tree Problem. / Zachariasen, Martin; Winter, Pawel.

In: Algorithmica, No. Vol.25, 1999, p. 418-437.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Zachariasen, M & Winter, P 1999, 'Concatenation-Based Greedy Heuristic for the Euclidean Steiner Tree Problem', Algorithmica, no. Vol.25, pp. 418-437.

APA

Zachariasen, M., & Winter, P. (1999). Concatenation-Based Greedy Heuristic for the Euclidean Steiner Tree Problem. Algorithmica, (Vol.25), 418-437.

Vancouver

Zachariasen M, Winter P. Concatenation-Based Greedy Heuristic for the Euclidean Steiner Tree Problem. Algorithmica. 1999;(Vol.25):418-437.

Author

Zachariasen, Martin ; Winter, Pawel. / Concatenation-Based Greedy Heuristic for the Euclidean Steiner Tree Problem. In: Algorithmica. 1999 ; No. Vol.25. pp. 418-437.

Bibtex

@article{1d0c106074c911dbbee902004c4f4f50,
title = "Concatenation-Based Greedy Heuristic for the Euclidean Steiner Tree Problem",
abstract = "Heuristics, Steiner trees",
author = "Martin Zachariasen and Pawel Winter",
year = "1999",
language = "English",
pages = "418--437",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer",
number = "Vol.25",

}

RIS

TY - JOUR

T1 - Concatenation-Based Greedy Heuristic for the Euclidean Steiner Tree Problem

AU - Zachariasen, Martin

AU - Winter, Pawel

PY - 1999

Y1 - 1999

N2 - Heuristics, Steiner trees

AB - Heuristics, Steiner trees

M3 - Journal article

SP - 418

EP - 437

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - Vol.25

ER -

ID: 194393