Steiner tree problems in computer communication networks /:
The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Hackensack, NJ :
World Scientific,
©2008.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice. |
| Beschreibung: | 1 online resource (xiii, 359 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (pages 337-353) and index. |
| ISBN: | 9789812791450 9812791450 9812791442 9789812791443 1281933945 9781281933942 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn263426948 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 081024s2008 njua ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d YDXCP |d OCLCQ |d IDEBK |d OCLCQ |d OCLCF |d NLGGC |d M6U |d CNMTR |d OCLCQ |d COCUF |d ZCU |d OCLCQ |d VTS |d AGLDB |d VT2 |d OCLCQ |d WYU |d STF |d AU@ |d M8D |d UKAHL |d OCLCQ |d LEAUB |d HS0 |d K6U |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 019 | |a 696629533 |a 1055362612 |a 1064042657 |a 1081208583 |a 1086500453 | ||
| 020 | |a 9789812791450 |q (electronic bk.) | ||
| 020 | |a 9812791450 |q (electronic bk.) | ||
| 020 | |a 9812791442 | ||
| 020 | |a 9789812791443 | ||
| 020 | |a 1281933945 | ||
| 020 | |a 9781281933942 | ||
| 035 | |a (OCoLC)263426948 |z (OCoLC)696629533 |z (OCoLC)1055362612 |z (OCoLC)1064042657 |z (OCoLC)1081208583 |z (OCoLC)1086500453 | ||
| 050 | 4 | |a QA166.3 |b .D8 2008eb | |
| 072 | 7 | |a COM |x 043060 |2 bisacsh | |
| 072 | 7 | |a COM |x 020000 |2 bisacsh | |
| 072 | 7 | |a PGK |2 bicssc | |
| 082 | 7 | |a 004.6 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Du, Dingzhu. |0 http://id.loc.gov/authorities/names/n88207689 | |
| 245 | 1 | 0 | |a Steiner tree problems in computer communication networks / |c Dingzhu Du, Xiaodong Hu. |
| 260 | |a Hackensack, NJ : |b World Scientific, |c ©2008. | ||
| 300 | |a 1 online resource (xiii, 359 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 504 | |a Includes bibliographical references (pages 337-353) and index. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a 1. Minimax approach and Steiner ratio. 1.1. Minimax approach. 1.2. Steiner ratio in the Euclidean plane. 1.3. Steiner ratios in other metric spaces. 1.4. Discussions -- 2. k-Steiner ratios and better approximation algorithms. 2.1. k-Steiner ratio. 2.2. Approximations better than minimum spanning tree. 2.3. Discussions -- 3. Geometric partitions and polynomial time approximation schemes. 3.1. Guillotine cut for rectangular partition. 3.2. Portals. 3.3. Banyan and Spanner. 3.4. Discussions -- 4. Grade of service Steiner Tree problem. 4.1. GoSST problem in the Euclidean plane. 4.2. Minimum GoSST problem in graphs. 4.3. Discussions -- 5. Steiner Tree problem for minimal Steiner points. 5.1. In the Euclidean plane. 5.2. In the rectilinear plane. 5.3. In metric spaces. 5.4. Discussions -- 6. Bottleneck Steiner tree problem. 6.1. Complexity study. 6.2. Steinerized minimum spanning tree algorithm. 6.3. 3-restricted Steiner Tree algorithm. 6.4. Discussions -- 7. Steiner k-Tree and k-Path routing problems. 7.1. Problem formulation and complexity study. 7.2. Algorithms for k-Path routing problem. 7.3. Algorithms for k-Tree routing problem. 7.4. Discussions -- 8. Steiner Tree coloring problem. 8.1. Maximum tree coloring. 8.2. Minimum tree coloring. 8.3. Discussions -- 9. Steiner Tree scheduling problem. 9.1. Minimum aggregation time. 9.2. Minimum multicast time problem. 9.3. Discussions -- 10. Survivable Steiner network problem. 10.1. Minimum k-connected Steiner networks. 10.2. Minimum weak two-connected Steiner networks. 10.3. Minimum weak three-edge-connected Steiner networks. 10.4. Discussions. | |
| 520 | |a The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice. | ||
| 650 | 0 | |a Steiner systems. |0 http://id.loc.gov/authorities/subjects/sh85127898 | |
| 650 | 0 | |a Computer networks. |0 http://id.loc.gov/authorities/subjects/sh85029513 | |
| 650 | 2 | |a Computer Communication Networks |0 https://id.nlm.nih.gov/mesh/D003195 | |
| 650 | 6 | |a Systèmes de Steiner. | |
| 650 | 6 | |a Réseaux d'ordinateurs. | |
| 650 | 7 | |a COMPUTERS |x Networking |x Vendor Specific. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Data Transmission Systems |x General. |2 bisacsh | |
| 650 | 7 | |a Computer networks |2 fast | |
| 650 | 7 | |a Steiner systems |2 fast | |
| 700 | 1 | |a Hu, Xiaodong. |0 http://id.loc.gov/authorities/names/n90685315 | |
| 758 | |i has work: |a Steiner tree problems in computer communication networks (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGQd8M8VDCjKtvrHmPtrmd |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Du, Dingzhu. |t Steiner tree problems in computer communication networks. |d Hackensack, NJ : World Scientific, ©2008 |z 9812791442 |z 9789812791443 |w (DLC) 2008299551 |w (OCoLC)191658455 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=236079 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH24684965 | ||
| 938 | |a EBSCOhost |b EBSC |n 236079 | ||
| 938 | |a YBP Library Services |b YANK |n 2895718 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn263426948 |
|---|---|
| _version_ | 1816881680457138177 |
| adam_text | |
| any_adam_object | |
| author | Du, Dingzhu |
| author2 | Hu, Xiaodong |
| author2_role | |
| author2_variant | x h xh |
| author_GND | http://id.loc.gov/authorities/names/n88207689 http://id.loc.gov/authorities/names/n90685315 |
| author_facet | Du, Dingzhu Hu, Xiaodong |
| author_role | |
| author_sort | Du, Dingzhu |
| author_variant | d d dd |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.3 .D8 2008eb |
| callnumber-search | QA166.3 .D8 2008eb |
| callnumber-sort | QA 3166.3 D8 42008EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | 1. Minimax approach and Steiner ratio. 1.1. Minimax approach. 1.2. Steiner ratio in the Euclidean plane. 1.3. Steiner ratios in other metric spaces. 1.4. Discussions -- 2. k-Steiner ratios and better approximation algorithms. 2.1. k-Steiner ratio. 2.2. Approximations better than minimum spanning tree. 2.3. Discussions -- 3. Geometric partitions and polynomial time approximation schemes. 3.1. Guillotine cut for rectangular partition. 3.2. Portals. 3.3. Banyan and Spanner. 3.4. Discussions -- 4. Grade of service Steiner Tree problem. 4.1. GoSST problem in the Euclidean plane. 4.2. Minimum GoSST problem in graphs. 4.3. Discussions -- 5. Steiner Tree problem for minimal Steiner points. 5.1. In the Euclidean plane. 5.2. In the rectilinear plane. 5.3. In metric spaces. 5.4. Discussions -- 6. Bottleneck Steiner tree problem. 6.1. Complexity study. 6.2. Steinerized minimum spanning tree algorithm. 6.3. 3-restricted Steiner Tree algorithm. 6.4. Discussions -- 7. Steiner k-Tree and k-Path routing problems. 7.1. Problem formulation and complexity study. 7.2. Algorithms for k-Path routing problem. 7.3. Algorithms for k-Tree routing problem. 7.4. Discussions -- 8. Steiner Tree coloring problem. 8.1. Maximum tree coloring. 8.2. Minimum tree coloring. 8.3. Discussions -- 9. Steiner Tree scheduling problem. 9.1. Minimum aggregation time. 9.2. Minimum multicast time problem. 9.3. Discussions -- 10. Survivable Steiner network problem. 10.1. Minimum k-connected Steiner networks. 10.2. Minimum weak two-connected Steiner networks. 10.3. Minimum weak three-edge-connected Steiner networks. 10.4. Discussions. |
| ctrlnum | (OCoLC)263426948 |
| dewey-full | 004.6 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.6 |
| dewey-search | 004.6 |
| dewey-sort | 14.6 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05161cam a2200613 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn263426948</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">081024s2008 njua ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">NLGGC</subfield><subfield code="d">M6U</subfield><subfield code="d">CNMTR</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COCUF</subfield><subfield code="d">ZCU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">AGLDB</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">STF</subfield><subfield code="d">AU@</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">LEAUB</subfield><subfield code="d">HS0</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">696629533</subfield><subfield code="a">1055362612</subfield><subfield code="a">1064042657</subfield><subfield code="a">1081208583</subfield><subfield code="a">1086500453</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789812791450</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9812791450</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9812791442</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789812791443</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1281933945</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781281933942</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)263426948</subfield><subfield code="z">(OCoLC)696629533</subfield><subfield code="z">(OCoLC)1055362612</subfield><subfield code="z">(OCoLC)1064042657</subfield><subfield code="z">(OCoLC)1081208583</subfield><subfield code="z">(OCoLC)1086500453</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166.3</subfield><subfield code="b">.D8 2008eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">043060</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">020000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">PGK</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">004.6</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Du, Dingzhu.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n88207689</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Steiner tree problems in computer communication networks /</subfield><subfield code="c">Dingzhu Du, Xiaodong Hu.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Hackensack, NJ :</subfield><subfield code="b">World Scientific,</subfield><subfield code="c">©2008.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 359 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 337-353) and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">1. Minimax approach and Steiner ratio. 1.1. Minimax approach. 1.2. Steiner ratio in the Euclidean plane. 1.3. Steiner ratios in other metric spaces. 1.4. Discussions -- 2. k-Steiner ratios and better approximation algorithms. 2.1. k-Steiner ratio. 2.2. Approximations better than minimum spanning tree. 2.3. Discussions -- 3. Geometric partitions and polynomial time approximation schemes. 3.1. Guillotine cut for rectangular partition. 3.2. Portals. 3.3. Banyan and Spanner. 3.4. Discussions -- 4. Grade of service Steiner Tree problem. 4.1. GoSST problem in the Euclidean plane. 4.2. Minimum GoSST problem in graphs. 4.3. Discussions -- 5. Steiner Tree problem for minimal Steiner points. 5.1. In the Euclidean plane. 5.2. In the rectilinear plane. 5.3. In metric spaces. 5.4. Discussions -- 6. Bottleneck Steiner tree problem. 6.1. Complexity study. 6.2. Steinerized minimum spanning tree algorithm. 6.3. 3-restricted Steiner Tree algorithm. 6.4. Discussions -- 7. Steiner k-Tree and k-Path routing problems. 7.1. Problem formulation and complexity study. 7.2. Algorithms for k-Path routing problem. 7.3. Algorithms for k-Tree routing problem. 7.4. Discussions -- 8. Steiner Tree coloring problem. 8.1. Maximum tree coloring. 8.2. Minimum tree coloring. 8.3. Discussions -- 9. Steiner Tree scheduling problem. 9.1. Minimum aggregation time. 9.2. Minimum multicast time problem. 9.3. Discussions -- 10. Survivable Steiner network problem. 10.1. Minimum k-connected Steiner networks. 10.2. Minimum weak two-connected Steiner networks. 10.3. Minimum weak three-edge-connected Steiner networks. 10.4. Discussions.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Steiner systems.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85127898</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer networks.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85029513</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Computer Communication Networks</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D003195</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Systèmes de Steiner.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Réseaux d'ordinateurs.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Networking</subfield><subfield code="x">Vendor Specific.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Data Transmission Systems</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer networks</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Steiner systems</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hu, Xiaodong.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n90685315</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Steiner tree problems in computer communication networks (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGQd8M8VDCjKtvrHmPtrmd</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Du, Dingzhu.</subfield><subfield code="t">Steiner tree problems in computer communication networks.</subfield><subfield code="d">Hackensack, NJ : World Scientific, ©2008</subfield><subfield code="z">9812791442</subfield><subfield code="z">9789812791443</subfield><subfield code="w">(DLC) 2008299551</subfield><subfield code="w">(OCoLC)191658455</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=236079</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH24684965</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">236079</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2895718</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn263426948 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:16:33Z |
| institution | BVB |
| isbn | 9789812791450 9812791450 9812791442 9789812791443 1281933945 9781281933942 |
| language | English |
| oclc_num | 263426948 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xiii, 359 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | World Scientific, |
| record_format | marc |
| spelling | Du, Dingzhu. http://id.loc.gov/authorities/names/n88207689 Steiner tree problems in computer communication networks / Dingzhu Du, Xiaodong Hu. Hackensack, NJ : World Scientific, ©2008. 1 online resource (xiii, 359 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references (pages 337-353) and index. Print version record. 1. Minimax approach and Steiner ratio. 1.1. Minimax approach. 1.2. Steiner ratio in the Euclidean plane. 1.3. Steiner ratios in other metric spaces. 1.4. Discussions -- 2. k-Steiner ratios and better approximation algorithms. 2.1. k-Steiner ratio. 2.2. Approximations better than minimum spanning tree. 2.3. Discussions -- 3. Geometric partitions and polynomial time approximation schemes. 3.1. Guillotine cut for rectangular partition. 3.2. Portals. 3.3. Banyan and Spanner. 3.4. Discussions -- 4. Grade of service Steiner Tree problem. 4.1. GoSST problem in the Euclidean plane. 4.2. Minimum GoSST problem in graphs. 4.3. Discussions -- 5. Steiner Tree problem for minimal Steiner points. 5.1. In the Euclidean plane. 5.2. In the rectilinear plane. 5.3. In metric spaces. 5.4. Discussions -- 6. Bottleneck Steiner tree problem. 6.1. Complexity study. 6.2. Steinerized minimum spanning tree algorithm. 6.3. 3-restricted Steiner Tree algorithm. 6.4. Discussions -- 7. Steiner k-Tree and k-Path routing problems. 7.1. Problem formulation and complexity study. 7.2. Algorithms for k-Path routing problem. 7.3. Algorithms for k-Tree routing problem. 7.4. Discussions -- 8. Steiner Tree coloring problem. 8.1. Maximum tree coloring. 8.2. Minimum tree coloring. 8.3. Discussions -- 9. Steiner Tree scheduling problem. 9.1. Minimum aggregation time. 9.2. Minimum multicast time problem. 9.3. Discussions -- 10. Survivable Steiner network problem. 10.1. Minimum k-connected Steiner networks. 10.2. Minimum weak two-connected Steiner networks. 10.3. Minimum weak three-edge-connected Steiner networks. 10.4. Discussions. The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice. Steiner systems. http://id.loc.gov/authorities/subjects/sh85127898 Computer networks. http://id.loc.gov/authorities/subjects/sh85029513 Computer Communication Networks https://id.nlm.nih.gov/mesh/D003195 Systèmes de Steiner. Réseaux d'ordinateurs. COMPUTERS Networking Vendor Specific. bisacsh COMPUTERS Data Transmission Systems General. bisacsh Computer networks fast Steiner systems fast Hu, Xiaodong. http://id.loc.gov/authorities/names/n90685315 has work: Steiner tree problems in computer communication networks (Text) https://id.oclc.org/worldcat/entity/E39PCGQd8M8VDCjKtvrHmPtrmd https://id.oclc.org/worldcat/ontology/hasWork Print version: Du, Dingzhu. Steiner tree problems in computer communication networks. Hackensack, NJ : World Scientific, ©2008 9812791442 9789812791443 (DLC) 2008299551 (OCoLC)191658455 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=236079 Volltext |
| spellingShingle | Du, Dingzhu Steiner tree problems in computer communication networks / 1. Minimax approach and Steiner ratio. 1.1. Minimax approach. 1.2. Steiner ratio in the Euclidean plane. 1.3. Steiner ratios in other metric spaces. 1.4. Discussions -- 2. k-Steiner ratios and better approximation algorithms. 2.1. k-Steiner ratio. 2.2. Approximations better than minimum spanning tree. 2.3. Discussions -- 3. Geometric partitions and polynomial time approximation schemes. 3.1. Guillotine cut for rectangular partition. 3.2. Portals. 3.3. Banyan and Spanner. 3.4. Discussions -- 4. Grade of service Steiner Tree problem. 4.1. GoSST problem in the Euclidean plane. 4.2. Minimum GoSST problem in graphs. 4.3. Discussions -- 5. Steiner Tree problem for minimal Steiner points. 5.1. In the Euclidean plane. 5.2. In the rectilinear plane. 5.3. In metric spaces. 5.4. Discussions -- 6. Bottleneck Steiner tree problem. 6.1. Complexity study. 6.2. Steinerized minimum spanning tree algorithm. 6.3. 3-restricted Steiner Tree algorithm. 6.4. Discussions -- 7. Steiner k-Tree and k-Path routing problems. 7.1. Problem formulation and complexity study. 7.2. Algorithms for k-Path routing problem. 7.3. Algorithms for k-Tree routing problem. 7.4. Discussions -- 8. Steiner Tree coloring problem. 8.1. Maximum tree coloring. 8.2. Minimum tree coloring. 8.3. Discussions -- 9. Steiner Tree scheduling problem. 9.1. Minimum aggregation time. 9.2. Minimum multicast time problem. 9.3. Discussions -- 10. Survivable Steiner network problem. 10.1. Minimum k-connected Steiner networks. 10.2. Minimum weak two-connected Steiner networks. 10.3. Minimum weak three-edge-connected Steiner networks. 10.4. Discussions. Steiner systems. http://id.loc.gov/authorities/subjects/sh85127898 Computer networks. http://id.loc.gov/authorities/subjects/sh85029513 Computer Communication Networks https://id.nlm.nih.gov/mesh/D003195 Systèmes de Steiner. Réseaux d'ordinateurs. COMPUTERS Networking Vendor Specific. bisacsh COMPUTERS Data Transmission Systems General. bisacsh Computer networks fast Steiner systems fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85127898 http://id.loc.gov/authorities/subjects/sh85029513 https://id.nlm.nih.gov/mesh/D003195 |
| title | Steiner tree problems in computer communication networks / |
| title_auth | Steiner tree problems in computer communication networks / |
| title_exact_search | Steiner tree problems in computer communication networks / |
| title_full | Steiner tree problems in computer communication networks / Dingzhu Du, Xiaodong Hu. |
| title_fullStr | Steiner tree problems in computer communication networks / Dingzhu Du, Xiaodong Hu. |
| title_full_unstemmed | Steiner tree problems in computer communication networks / Dingzhu Du, Xiaodong Hu. |
| title_short | Steiner tree problems in computer communication networks / |
| title_sort | steiner tree problems in computer communication networks |
| topic | Steiner systems. http://id.loc.gov/authorities/subjects/sh85127898 Computer networks. http://id.loc.gov/authorities/subjects/sh85029513 Computer Communication Networks https://id.nlm.nih.gov/mesh/D003195 Systèmes de Steiner. Réseaux d'ordinateurs. COMPUTERS Networking Vendor Specific. bisacsh COMPUTERS Data Transmission Systems General. bisacsh Computer networks fast Steiner systems fast |
| topic_facet | Steiner systems. Computer networks. Computer Communication Networks Systèmes de Steiner. Réseaux d'ordinateurs. COMPUTERS Networking Vendor Specific. COMPUTERS Data Transmission Systems General. Computer networks Steiner systems |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=236079 |
| work_keys_str_mv | AT dudingzhu steinertreeproblemsincomputercommunicationnetworks AT huxiaodong steinertreeproblemsincomputercommunicationnetworks |