The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Wiesbaden
Vieweg+Teubner Verlag
2002
|
| Schriftenreihe: | Advanced Lectures in Mathematics
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity. No specific previous knowledge is assumed. The central theme of the book is a geometrical problem dating back to Jakob Steiner. This problem, now called the Steiner problem, was initially of importance only within the context of land surveying. In the last decade, however, applications as diverse as VLSI-layout and the study of phylogenetic trees led to a rapid rise of interest in this problem. The resulting progress has uncovered fascinating connections between and within graph theory, the study of algorithms, and complexity theory. This single problem thus serves to bind and motivate these areas. The book's topics include: exact algorithms, computational complexity, approximation algorithms, the use of randomness, limits of approximability. A special feature of the book is that each chapter ends with an "excursion" into some related area. These excursions reinforce the concepts and methods introduced for the Steiner problem by placing them in a broader context |
| Beschreibung: | 1 Online-Ressource (VIII, 241p) |
| ISBN: | 9783322802910 9783528067625 |
| ISSN: | 0932-7134 |
| DOI: | 10.1007/978-3-322-80291-0 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042422363 | ||
| 003 | DE-604 | ||
| 005 | 20180118 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2002 |||| o||u| ||||||eng d | ||
| 020 | |a 9783322802910 |c Online |9 978-3-322-80291-0 | ||
| 020 | |a 9783528067625 |c Print |9 978-3-528-06762-5 | ||
| 024 | 7 | |a 10.1007/978-3-322-80291-0 |2 doi | |
| 035 | |a (OCoLC)863868500 | ||
| 035 | |a (DE-599)BVBBV042422363 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 511.4 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Prömel, Hans Jürgen |d 1953- |e Verfasser |0 (DE-588)109885015 |4 aut | |
| 245 | 1 | 0 | |a The Steiner Tree Problem |b A Tour through Graphs, Algorithms, and Complexity |c by Hans Jürgen Prömel, Angelika Steger |
| 264 | 1 | |a Wiesbaden |b Vieweg+Teubner Verlag |c 2002 | |
| 300 | |a 1 Online-Ressource (VIII, 241p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Advanced Lectures in Mathematics |x 0932-7134 | |
| 500 | |a In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity. No specific previous knowledge is assumed. The central theme of the book is a geometrical problem dating back to Jakob Steiner. This problem, now called the Steiner problem, was initially of importance only within the context of land surveying. In the last decade, however, applications as diverse as VLSI-layout and the study of phylogenetic trees led to a rapid rise of interest in this problem. The resulting progress has uncovered fascinating connections between and within graph theory, the study of algorithms, and complexity theory. This single problem thus serves to bind and motivate these areas. The book's topics include: exact algorithms, computational complexity, approximation algorithms, the use of randomness, limits of approximability. A special feature of the book is that each chapter ends with an "excursion" into some related area. These excursions reinforce the concepts and methods introduced for the Steiner problem by placing them in a broader context | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Algebra | |
| 650 | 4 | |a Approximations and Expansions | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Steiner-Baum |0 (DE-588)4228498-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Steiner-Problem |0 (DE-588)4248342-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Steiner-Problem |0 (DE-588)4248342-6 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 689 | 3 | 0 | |a Steiner-Baum |0 (DE-588)4228498-3 |D s |
| 689 | 3 | |8 4\p |5 DE-604 | |
| 700 | 1 | |a Steger, Angelika |d 1962- |e Sonstige |0 (DE-588)170730433 |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-322-80291-0 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027857780 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153096743419904 |
|---|---|
| any_adam_object | |
| author | Prömel, Hans Jürgen 1953- |
| author_GND | (DE-588)109885015 (DE-588)170730433 |
| author_facet | Prömel, Hans Jürgen 1953- |
| author_role | aut |
| author_sort | Prömel, Hans Jürgen 1953- |
| author_variant | h j p hj hjp |
| building | Verbundindex |
| bvnumber | BV042422363 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)863868500 (DE-599)BVBBV042422363 |
| dewey-full | 511.4 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.4 |
| dewey-search | 511.4 |
| dewey-sort | 3511.4 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-3-322-80291-0 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03653nmm a2200613zc 4500</leader><controlfield tag="001">BV042422363</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180118 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783322802910</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-322-80291-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783528067625</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-528-06762-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-322-80291-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863868500</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042422363</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-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.4</subfield><subfield code="2">23</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">Prömel, Hans Jürgen</subfield><subfield code="d">1953-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109885015</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Steiner Tree Problem</subfield><subfield code="b">A Tour through Graphs, Algorithms, and Complexity</subfield><subfield code="c">by Hans Jürgen Prömel, Angelika Steger</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Wiesbaden</subfield><subfield code="b">Vieweg+Teubner Verlag</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 241p)</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="0" ind2=" "><subfield code="a">Advanced Lectures in Mathematics</subfield><subfield code="x">0932-7134</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity. No specific previous knowledge is assumed. The central theme of the book is a geometrical problem dating back to Jakob Steiner. This problem, now called the Steiner problem, was initially of importance only within the context of land surveying. In the last decade, however, applications as diverse as VLSI-layout and the study of phylogenetic trees led to a rapid rise of interest in this problem. The resulting progress has uncovered fascinating connections between and within graph theory, the study of algorithms, and complexity theory. This single problem thus serves to bind and motivate these areas. The book's topics include: exact algorithms, computational complexity, approximation algorithms, the use of randomness, limits of approximability. A special feature of the book is that each chapter ends with an "excursion" into some related area. These excursions reinforce the concepts and methods introduced for the Steiner problem by placing them in a broader context</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximations and Expansions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Steiner-Baum</subfield><subfield code="0">(DE-588)4228498-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Steiner-Problem</subfield><subfield code="0">(DE-588)4248342-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Steiner-Problem</subfield><subfield code="0">(DE-588)4248342-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Steiner-Baum</subfield><subfield code="0">(DE-588)4228498-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Steger, Angelika</subfield><subfield code="d">1962-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)170730433</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-322-80291-0</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027857780</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042422363 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:11Z |
| institution | BVB |
| isbn | 9783322802910 9783528067625 |
| issn | 0932-7134 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027857780 |
| oclc_num | 863868500 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (VIII, 241p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Vieweg+Teubner Verlag |
| record_format | marc |
| series2 | Advanced Lectures in Mathematics |
| spelling | Prömel, Hans Jürgen 1953- Verfasser (DE-588)109885015 aut The Steiner Tree Problem A Tour through Graphs, Algorithms, and Complexity by Hans Jürgen Prömel, Angelika Steger Wiesbaden Vieweg+Teubner Verlag 2002 1 Online-Ressource (VIII, 241p) txt rdacontent c rdamedia cr rdacarrier Advanced Lectures in Mathematics 0932-7134 In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity. No specific previous knowledge is assumed. The central theme of the book is a geometrical problem dating back to Jakob Steiner. This problem, now called the Steiner problem, was initially of importance only within the context of land surveying. In the last decade, however, applications as diverse as VLSI-layout and the study of phylogenetic trees led to a rapid rise of interest in this problem. The resulting progress has uncovered fascinating connections between and within graph theory, the study of algorithms, and complexity theory. This single problem thus serves to bind and motivate these areas. The book's topics include: exact algorithms, computational complexity, approximation algorithms, the use of randomness, limits of approximability. A special feature of the book is that each chapter ends with an "excursion" into some related area. These excursions reinforce the concepts and methods introduced for the Steiner problem by placing them in a broader context Mathematics Algebra Approximations and Expansions Mathematik Algorithmus (DE-588)4001183-5 gnd rswk-swf Steiner-Baum (DE-588)4228498-3 gnd rswk-swf Steiner-Problem (DE-588)4248342-6 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 Algorithmus (DE-588)4001183-5 s 2\p DE-604 Steiner-Problem (DE-588)4248342-6 s 3\p DE-604 Steiner-Baum (DE-588)4228498-3 s 4\p DE-604 Steger, Angelika 1962- Sonstige (DE-588)170730433 oth https://doi.org/10.1007/978-3-322-80291-0 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Prömel, Hans Jürgen 1953- The Steiner Tree Problem A Tour through Graphs, Algorithms, and Complexity Mathematics Algebra Approximations and Expansions Mathematik Algorithmus (DE-588)4001183-5 gnd Steiner-Baum (DE-588)4228498-3 gnd Steiner-Problem (DE-588)4248342-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4228498-3 (DE-588)4248342-6 (DE-588)4120591-1 |
| title | The Steiner Tree Problem A Tour through Graphs, Algorithms, and Complexity |
| title_auth | The Steiner Tree Problem A Tour through Graphs, Algorithms, and Complexity |
| title_exact_search | The Steiner Tree Problem A Tour through Graphs, Algorithms, and Complexity |
| title_full | The Steiner Tree Problem A Tour through Graphs, Algorithms, and Complexity by Hans Jürgen Prömel, Angelika Steger |
| title_fullStr | The Steiner Tree Problem A Tour through Graphs, Algorithms, and Complexity by Hans Jürgen Prömel, Angelika Steger |
| title_full_unstemmed | The Steiner Tree Problem A Tour through Graphs, Algorithms, and Complexity by Hans Jürgen Prömel, Angelika Steger |
| title_short | The Steiner Tree Problem |
| title_sort | the steiner tree problem a tour through graphs algorithms and complexity |
| title_sub | A Tour through Graphs, Algorithms, and Complexity |
| topic | Mathematics Algebra Approximations and Expansions Mathematik Algorithmus (DE-588)4001183-5 gnd Steiner-Baum (DE-588)4228498-3 gnd Steiner-Problem (DE-588)4248342-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Mathematics Algebra Approximations and Expansions Mathematik Algorithmus Steiner-Baum Steiner-Problem Komplexitätstheorie |
| url | https://doi.org/10.1007/978-3-322-80291-0 |
| work_keys_str_mv | AT promelhansjurgen thesteinertreeproblematourthroughgraphsalgorithmsandcomplexity AT stegerangelika thesteinertreeproblematourthroughgraphsalgorithmsandcomplexity |