Optimal interconnection trees in the plane: theory, algorithms and applications
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cham [u.a.]
Springer
2015
|
Schriftenreihe: | Algorithms and Combinatorics
29 |
Schlagworte: | |
Online-Zugang: | BTU01 FRO01 TUM01 UBM01 UBT01 UBW01 UPA01 Volltext Inhaltsverzeichnis Abstract |
Beschreibung: | 1 Online-Ressource (XVII, 344 S.) 150 illus., 135 illus. in color |
ISBN: | 9783319139159 |
ISSN: | 0937-5511 |
DOI: | 10.1007/978-3-319-13915-9 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV042544355 | ||
003 | DE-604 | ||
005 | 20200929 | ||
007 | cr|uuu---uuuuu | ||
008 | 150506s2015 |||| o||u| ||||||eng d | ||
020 | |a 9783319139159 |c Online |9 978-3-319-13915-9 | ||
024 | 7 | |a 10.1007/978-3-319-13915-9 |2 doi | |
035 | |a (OCoLC)909064135 | ||
035 | |a (DE-599)BVBBV042544355 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-91 |a DE-19 |a DE-703 |a DE-20 |a DE-739 |a DE-634 |a DE-861 |a DE-83 | ||
082 | 0 | |a 511.6 |2 23 | |
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
084 | |a MAT 000 |2 stub | ||
100 | 1 | |a Brazil, Marcus |e Verfasser |4 aut | |
245 | 1 | 0 | |a Optimal interconnection trees in the plane |b theory, algorithms and applications |c Marcus Brazil ; Martin Zachariasen |
264 | 1 | |a Cham [u.a.] |b Springer |c 2015 | |
300 | |a 1 Online-Ressource (XVII, 344 S.) |b 150 illus., 135 illus. in color | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Algorithms and combinatorics |v 29 |x 0937-5511 | |
650 | 4 | |a Mathematics | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Algorithms | |
650 | 4 | |a Combinatorics | |
650 | 4 | |a Geometry | |
650 | 4 | |a Mathematical optimization | |
650 | 4 | |a Engineering mathematics | |
650 | 4 | |a Discrete Mathematics in Computer Science | |
650 | 4 | |a Optimization | |
650 | 4 | |a Appl.Mathematics/Computational Methods of Engineering | |
650 | 4 | |a Mathematik | |
700 | 1 | |a Zachariasen, Martin |e Verfasser |0 (DE-588)122973933 |4 aut | |
776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-3-319-13914-2 |
830 | 0 | |a Algorithms and Combinatorics |v 29 |w (DE-604)BV023819262 |9 29 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-319-13915-9 |x Verlag |3 Volltext |
856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027978361&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027978361&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Abstract |
912 | |a ZDB-2-SMA | ||
940 | 1 | |q UBY_PDA_SMA | |
940 | 1 | |q ZDB-2-SMA_2015 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-027978361 | ||
966 | e | |u https://doi.org/10.1007/978-3-319-13915-9 |l BTU01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-13915-9 |l FRO01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-13915-9 |l TUM01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-13915-9 |l UBM01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-13915-9 |l UBT01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-13915-9 |l UBW01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-13915-9 |l UPA01 |p ZDB-2-SMA |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804153309805674496 |
---|---|
adam_text | OPTIMAL INTERCONNECTION TREES IN THE PLANE
/ BRAZIL, MARCUS
: 2015
TABLE OF CONTENTS / INHALTSVERZEICHNIS
PREFACE:- 1 EUCLIDEAN AND MINKOWSKI STEINER TREES
2 FIXED ORIENTATION STEINER TREES
3 RECTILINEAR STEINER TREES
4 STEINER TREES WITH OTHER COSTS AND CONSTRAINTS
5 STEINER TREES IN GRAPHS AND HYPERGRAPHS
A APPENDIX
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
OPTIMAL INTERCONNECTION TREES IN THE PLANE
/ BRAZIL, MARCUS
: 2015
ABSTRACT / INHALTSTEXT
THIS BOOK EXPLORES FUNDAMENTAL ASPECTS OF GEOMETRIC NETWORK OPTIMISATION
WITH APPLICATIONS TO A VARIETY OF REAL WORLD PROBLEMS. IT PRESENTS, FOR
THE FIRST TIME IN THE LITERATURE, A COHESIVE MATHEMATICAL FRAMEWORK
WITHIN WHICH THE PROPERTIES OF SUCH OPTIMAL INTERCONNECTION NETWORKS CAN
BE UNDERSTOOD ACROSS A WIDE RANGE OF METRICS AND COST FUNCTIONS. THE
BOOK MAKES USE OF THIS MATHEMATICAL THEORY TO DEVELOP EFFICIENT
ALGORITHMS FOR CONSTRUCTING SUCH NETWORKS, WITH AN EMPHASIS ON EXACT
SOLUTIONS. MARCUS BRAZIL AND MARTIN ZACHARIASEN FOCUS PRINCIPALLY ON
THE GEOMETRIC STRUCTURE OF OPTIMAL INTERCONNECTION NETWORKS, ALSO KNOWN
AS STEINER TREES, IN THE PLANE. THEY SHOW READERS HOW AN UNDERSTANDING
OF THIS STRUCTURE CAN LEAD TO PRACTICAL EXACT ALGORITHMS FOR
CONSTRUCTING SUCH TREES. THE BOOK ALSO DETAILS NUMEROUS BREAKTHROUGHS
IN THIS AREA OVER THE PAST 20 YEARS, FEATURES CLEARLY WRITTEN PROOFS,
AND IS SUPPORTED BY 135 COLOUR AND 15 BLACK AND WHITE FIGURES. IT WILL
HELP GRADUATE STUDENTS, WORKING MATHEMATICIANS, ENGINEERS AND COMPUTER
SCIENTISTS TO UNDERSTAND THE PRINCIPLES REQUIRED FOR DESIGNING
INTERCONNECTION NETWORKS IN THE PLANE THAT ARE AS COST EFFICIENT AS
POSSIBLE
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
|
any_adam_object | 1 |
author | Brazil, Marcus Zachariasen, Martin |
author_GND | (DE-588)122973933 |
author_facet | Brazil, Marcus Zachariasen, Martin |
author_role | aut aut |
author_sort | Brazil, Marcus |
author_variant | m b mb m z mz |
building | Verbundindex |
bvnumber | BV042544355 |
classification_rvk | SK 890 |
classification_tum | MAT 000 |
collection | ZDB-2-SMA |
ctrlnum | (OCoLC)909064135 (DE-599)BVBBV042544355 |
dewey-full | 511.6 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.6 |
dewey-search | 511.6 |
dewey-sort | 3511.6 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
doi_str_mv | 10.1007/978-3-319-13915-9 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03044nmm a2200637zcb4500</leader><controlfield tag="001">BV042544355</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200929 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150506s2015 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319139159</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-319-13915-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-319-13915-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)909064135</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042544355</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brazil, Marcus</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal interconnection trees in the plane</subfield><subfield code="b">theory, algorithms and applications</subfield><subfield code="c">Marcus Brazil ; Martin Zachariasen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 344 S.)</subfield><subfield code="b">150 illus., 135 illus. in color</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Algorithms and combinatorics</subfield><subfield code="v">29</subfield><subfield code="x">0937-5511</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Appl.Mathematics/Computational Methods of Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zachariasen, Martin</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122973933</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-3-319-13914-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Algorithms and Combinatorics</subfield><subfield code="v">29</subfield><subfield code="w">(DE-604)BV023819262</subfield><subfield code="9">29</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-319-13915-9</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027978361&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027978361&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">UBY_PDA_SMA</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_2015</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027978361</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-13915-9</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-13915-9</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-13915-9</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-13915-9</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-13915-9</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-13915-9</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-13915-9</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV042544355 |
illustrated | Illustrated |
indexdate | 2024-07-10T01:24:34Z |
institution | BVB |
isbn | 9783319139159 |
issn | 0937-5511 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027978361 |
oclc_num | 909064135 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-703 DE-20 DE-739 DE-634 DE-861 DE-83 |
owner_facet | DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-703 DE-20 DE-739 DE-634 DE-861 DE-83 |
physical | 1 Online-Ressource (XVII, 344 S.) 150 illus., 135 illus. in color |
psigel | ZDB-2-SMA UBY_PDA_SMA ZDB-2-SMA_2015 |
publishDate | 2015 |
publishDateSearch | 2015 |
publishDateSort | 2015 |
publisher | Springer |
record_format | marc |
series | Algorithms and Combinatorics |
series2 | Algorithms and combinatorics |
spelling | Brazil, Marcus Verfasser aut Optimal interconnection trees in the plane theory, algorithms and applications Marcus Brazil ; Martin Zachariasen Cham [u.a.] Springer 2015 1 Online-Ressource (XVII, 344 S.) 150 illus., 135 illus. in color txt rdacontent c rdamedia cr rdacarrier Algorithms and combinatorics 29 0937-5511 Mathematics Computational complexity Algorithms Combinatorics Geometry Mathematical optimization Engineering mathematics Discrete Mathematics in Computer Science Optimization Appl.Mathematics/Computational Methods of Engineering Mathematik Zachariasen, Martin Verfasser (DE-588)122973933 aut Erscheint auch als Druckausgabe 978-3-319-13914-2 Algorithms and Combinatorics 29 (DE-604)BV023819262 29 https://doi.org/10.1007/978-3-319-13915-9 Verlag Volltext Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027978361&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027978361&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Abstract |
spellingShingle | Brazil, Marcus Zachariasen, Martin Optimal interconnection trees in the plane theory, algorithms and applications Algorithms and Combinatorics Mathematics Computational complexity Algorithms Combinatorics Geometry Mathematical optimization Engineering mathematics Discrete Mathematics in Computer Science Optimization Appl.Mathematics/Computational Methods of Engineering Mathematik |
title | Optimal interconnection trees in the plane theory, algorithms and applications |
title_auth | Optimal interconnection trees in the plane theory, algorithms and applications |
title_exact_search | Optimal interconnection trees in the plane theory, algorithms and applications |
title_full | Optimal interconnection trees in the plane theory, algorithms and applications Marcus Brazil ; Martin Zachariasen |
title_fullStr | Optimal interconnection trees in the plane theory, algorithms and applications Marcus Brazil ; Martin Zachariasen |
title_full_unstemmed | Optimal interconnection trees in the plane theory, algorithms and applications Marcus Brazil ; Martin Zachariasen |
title_short | Optimal interconnection trees in the plane |
title_sort | optimal interconnection trees in the plane theory algorithms and applications |
title_sub | theory, algorithms and applications |
topic | Mathematics Computational complexity Algorithms Combinatorics Geometry Mathematical optimization Engineering mathematics Discrete Mathematics in Computer Science Optimization Appl.Mathematics/Computational Methods of Engineering Mathematik |
topic_facet | Mathematics Computational complexity Algorithms Combinatorics Geometry Mathematical optimization Engineering mathematics Discrete Mathematics in Computer Science Optimization Appl.Mathematics/Computational Methods of Engineering Mathematik |
url | https://doi.org/10.1007/978-3-319-13915-9 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027978361&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027978361&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV023819262 |
work_keys_str_mv | AT brazilmarcus optimalinterconnectiontreesintheplanetheoryalgorithmsandapplications AT zachariasenmartin optimalinterconnectiontreesintheplanetheoryalgorithmsandapplications |