Zobrazeno 1 - 7
of 7
pro vyhledávání: '"David M. Warme"'
Publikováno v:
Mathematical Programming Computation. 10:487-532
The GeoSteiner software package has for about 20 years been the fastest (publicly available) program for computing exact solutions to Steiner tree problems in the plane. The computational study by Warme, Winter and Zachariasen, published in 2000, doc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6bddd464625af499ddec86c8a7235d6
https://doi.org/10.1007/s12532-018-0135-8
https://doi.org/10.1007/s12532-018-0135-8
Publikováno v:
IEEE Transactions on Signal Processing. 56:4419-4432
A new two-way multiple-input multiple-output (MIMO) channel sounding method for enabling a transmitter and a receiver both to have complete knowledge of the channel between them is presented. The key idea is that when the transmitter sends out its tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8ab081dcf5c0faf44ceaf85d5497f08
https://doi.org/10.1109/tsp.2008.925971
https://doi.org/10.1109/tsp.2008.925971
Autor:
Jeffrey S. Salowe, David M. Warme
Publikováno v:
Networks. 25:69-87
Given a set of terminals in the plane, a rectilinear Steiner minimal tree is a shortest interconnection among these terminals using only horizontal and vertical edges. We present an algorithm that constructs a rectilinear Steiner minimal tree for any
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e8b3a11e85f15010922173b6c559fba
https://doi.org/10.1002/net.3230250206
https://doi.org/10.1002/net.3230250206
Autor:
Jeffrey S. Salowe, David M. Warme
Publikováno v:
ICCD
Given a set of terminals in the plane, a rectilinear Steiner minimal tree is a shortest interconnection among these terminals using only horizontal and vertical edges. We present an algorithm that constructs a rectilinear Steiner minimal tree for an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::224d8ad8a7112be823d17c5d47a75780
https://doi.org/10.1109/iccd.1993.393331
https://doi.org/10.1109/iccd.1993.393331
Publikováno v:
Advances in Steiner Trees ISBN: 9781441948243
We present a computational study of exact algorithms for the Euclidean and rectilinear Steiner tree problems in the plane. These algorithms — which are based on the generation and concatenation of full Steiner trees — are much more efficient than
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::736f8e79571e24fb1bf9b0ba3f196583
https://doi.org/10.1007/978-1-4757-3171-2_6
https://doi.org/10.1007/978-1-4757-3171-2_6
Publikováno v:
IEEE Transactions on Signal Processing; Sep2008, Vol. 56 Issue 9, p4419-4432, 14p, 2 Diagrams, 9 Graphs
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.