Optimal Interconnection Trees in the Plane

Theory, Algorithms and Applications

Marcus Brazil, Martin Zachariasen

Publikation: Bog/antologi/afhandling/rapportBogForskningpeer review

OriginalsprogEngelsk
ForlagSpringer
Antal sider317
ISBN (Trykt)978-3-319-13914-2
ISBN (Elektronisk)978-3-319-13915-9
DOI
StatusUdgivet - 2015
Udgivet eksterntJa
NavnAlgorithms and Combinatorics
Vol/bind29
ISSN0937-5511

Citer dette

Brazil, M., & Zachariasen, M. (2015). Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications. Springer. Algorithms and Combinatorics, Bind. 29 https://doi.org/10.1007/978-3-319-13915-9
Brazil, Marcus ; Zachariasen, Martin. / Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications. Springer, 2015. 317 s. (Algorithms and Combinatorics, Bind 29).
@book{a1819de9a2da4a42b67148bc277c8a9e,
title = "Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications",
author = "Marcus Brazil and Martin Zachariasen",
year = "2015",
doi = "10.1007/978-3-319-13915-9",
language = "English",
isbn = "978-3-319-13914-2",
publisher = "Springer",
address = "Germany",

}

Brazil, M & Zachariasen, M 2015, Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications. Algorithms and Combinatorics, bind 29, Springer. https://doi.org/10.1007/978-3-319-13915-9

Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications. / Brazil, Marcus; Zachariasen, Martin.

Springer, 2015. 317 s. (Algorithms and Combinatorics, Bind 29).

Publikation: Bog/antologi/afhandling/rapportBogForskningpeer review

TY - BOOK

T1 - Optimal Interconnection Trees in the Plane

T2 - Theory, Algorithms and Applications

AU - Brazil, Marcus

AU - Zachariasen, Martin

PY - 2015

Y1 - 2015

U2 - 10.1007/978-3-319-13915-9

DO - 10.1007/978-3-319-13915-9

M3 - Book

SN - 978-3-319-13914-2

BT - Optimal Interconnection Trees in the Plane

PB - Springer

ER -

Brazil M, Zachariasen M. Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications. Springer, 2015. 317 s. (Algorithms and Combinatorics, Bind 29). https://doi.org/10.1007/978-3-319-13915-9