An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem

Benny Kjær Nielsen, Pawel Winter, Martin Zachariasen

22 Citations (Scopus)

Original language	English
Title of host publication	Proceedings of the 10-th European Symposium on Algorithms, Lecture Notes in Computer Science 2461
Volume	2461
Publisher	Springer
Publication date	2002
Pages	760-771
Publication status	Published - 2002
Event	European Symposium on Algorithms - Rome, Italy Duration: 17 Sept 2002 → 21 Sept 2002 Conference number: 10

Conference	European Symposium on Algorithms
Number	10
Country/Territory	Italy
City	Rome
Period	17/09/2002 → 21/09/2002

Cite this

Proceedings of the 10-th European Symposium on Algorithms, Lecture Notes in Computer Science 2461. Vol. 2461 Springer, 2002. p. 760-771.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

@inproceedings{efab5730655611de8bc9000ea68e967b,

title = "An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem",

author = "Nielsen, {Benny Kj{\ae}r} and Pawel Winter and Martin Zachariasen",

year = "2002",

language = "English",

volume = "2461",

pages = "760--771",

booktitle = "Proceedings of the 10-th European Symposium on Algorithms, Lecture Notes in Computer Science 2461",

publisher = "Springer",

note = "European Symposium on Algorithms ; Conference date: 17-09-2002 Through 21-09-2002",

}

TY - GEN

T1 - An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem

AU - Nielsen, Benny Kjær

AU - Winter, Pawel

AU - Zachariasen, Martin

N1 - Conference code: 10

PY - 2002

Y1 - 2002

M3 - Article in proceedings

VL - 2461

SP - 760

EP - 771

BT - Proceedings of the 10-th European Symposium on Algorithms, Lecture Notes in Computer Science 2461

PB - Springer

T2 - European Symposium on Algorithms

Y2 - 17 September 2002 through 21 September 2002

ER -