The Steiner tree problem: a tour through graphs, algorithms, and complexity
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Braunschweig [u.a.]
Vieweg
2002
|
Ausgabe: | 1. ed. |
Schriftenreihe: | Advanced lectures in mathematics
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | VII, 241 S. Ill., graph. Darst. |
ISBN: | 3528067624 |
Internformat
MARC
LEADER | 00000nam a22000008c 4500 | ||
---|---|---|---|
001 | BV014151361 | ||
003 | DE-604 | ||
005 | 20070301 | ||
007 | t | ||
008 | 020211s2002 gw ad|| |||| 00||| eng d | ||
016 | 7 | |a 963735381 |2 DE-101 | |
020 | |a 3528067624 |9 3-528-06762-4 | ||
035 | |a (OCoLC)49554546 | ||
035 | |a (DE-599)BVBBV014151361 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
049 | |a DE-384 |a DE-29T |a DE-739 |a DE-91G |a DE-92 |a DE-706 |a DE-20 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
050 | 0 | |a QA166.3 | |
082 | 0 | |a 511.5 |b P944s 2002 | |
084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
084 | |a DAT 517f |2 stub | ||
084 | |a 68R10 |2 msc | ||
084 | |a MAT 056f |2 stub | ||
084 | |a 05C35 |2 msc | ||
084 | |a DAT 537f |2 stub | ||
084 | |a 68Q17 |2 msc | ||
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 Hans Jürgen Prömel ; Angelika Steger |
250 | |a 1. ed. | ||
264 | 1 | |a Braunschweig [u.a.] |b Vieweg |c 2002 | |
300 | |a VII, 241 S. |b Ill., graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Advanced lectures in mathematics | |
650 | 4 | |a Algorithmes | |
650 | 7 | |a Algoritmen |2 gtt | |
650 | 7 | |a Bomen (wiskunde) |2 gtt | |
650 | 4 | |a Complexité de calcul (Informatique) | |
650 | 7 | |a Grafentheorie |2 gtt | |
650 | 4 | |a Graphes, Théorie des | |
650 | 4 | |a Steiner, Systèmes de | |
650 | 4 | |a Algorithms | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Graph theory | |
650 | 4 | |a Steiner systems | |
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 |
650 | 0 | 7 | |a Steiner-Baum |0 (DE-588)4228498-3 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Steiner-Problem |0 (DE-588)4248342-6 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Steiner-Baum |0 (DE-588)4228498-3 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 3 | |5 DE-604 | |
700 | 1 | |a Steger, Angelika |d 1962- |e Verfasser |0 (DE-588)170730433 |4 aut | |
856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009698726&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-009698726 |
Datensatz im Suchindex
_version_ | 1804129025960968192 |
---|---|
adam_text | HANS JURGEN PROMEL ANGELIKA STEGER THE STEINER TREE PROBLEM A TOUR
THROUGH GRAPHS, ALGORITHMS, AND COMPLEXITY VIEWEG CONTENTS 1 BASICS I:
GRAPHS 1 1.1 INTRODUCTION TO GRAPH THEORY 1 1.2 EXCURSION: RANDOM GRAPHS
9 2 BASICS II: ALGORITHMS 23 2.1 INTRODUCTION TO ALGORITHMS 23 2.2 -
EXCURSION: FIBONACCI HEAPS AND AMORTIZED TIME 31 3 BASICS III:
COMPLEXITY 41 3.1 INTRODUCTION TO COMPLEXITY THEORY 42 3.2 EXCURSION:
MORE NP-COMPLETE PROBLEMS 51 4 SPECIAL TERMINAL SETS 63 4.1 THE SHORTEST
PATH PROBLEM 63 4.2 THE MINIMUM SPANNING TREE PROBLEM 66 4.3 EXCURSION:
MATROIDS AND THE GREEDY ALGORITHM 68 5 EXACT ALGORITHMS 75 5.1 THE
ENUMERATION ALGORITHM 76 5.2 THE DREYFUS-WAGNER ALGORITHM 78 5.3
EXCURSION: DYNAMIC PROGRAMMING 81 6 APPROXIMATION ALGORITHMS 87 6.1 A
SIMPLE ALGORITHM WITH PERFORMANCE RATIO 2 88 6.2 IMPROVING THE TIME
COMPLEXITY 90 6.3 EXCURSION: MACHINE SCHEDULING 95 VIII 7 MORE ON
APPROXIMATION ALGORITHMS 107 7.1 MINIMUM SPANNING TREES IN HYPERGRAPHS
108 7.2 IMPROVING THE PERFORMANCE RATIO I 116 7.3 EXCURSION: THE
COMPLEXITY OF OPTIMIZATION PROBLEMS 121 8 RANDOMNESS HELPS 133 8.1
PROBABILISTIC COMPLEXITY CLASSES 133 8.2 IMPROVING THE PERFORMANCE RATIO
II 139 8.3 AN ALMOST ALWAYS OPTIMAL ALGORITHM 148 8.4 EXCURSION:
PRIMALITY AND CRYPTOGRAPHY 152 9 LIMITS OF APPROXIMABILITY 165 9.1
REDUCING OPTIMIZATION PROBLEMS 165 9.2 APX-COMPLETENESS 174 9.3
EXCURSION: PROBABILISTICALLY CHECKABLE PROOFS 179 10 GEOMETRIC STEINER
PROBLEMS 191 10.1 A CHARACTERIZATION OF RECTILINEAR STEINER MINIMUM
TREES . . . . 192 10.2 THE STEINER RATIOS 199 10.3 AN ALMOST LINEAR TIME
APPROXIMATION SCHEME 204 10.4 EXCURSION: THE EUCLIDEAN STEINER PROBLEM
212 BIBLIOGRAPHY 223 INDEX 233 SYMBOL INDEX 241
|
any_adam_object | 1 |
author | Prömel, Hans Jürgen 1953- Steger, Angelika 1962- |
author_GND | (DE-588)109885015 (DE-588)170730433 |
author_facet | Prömel, Hans Jürgen 1953- Steger, Angelika 1962- |
author_role | aut aut |
author_sort | Prömel, Hans Jürgen 1953- |
author_variant | h j p hj hjp a s as |
building | Verbundindex |
bvnumber | BV014151361 |
callnumber-first | Q - Science |
callnumber-label | QA166 |
callnumber-raw | QA166.3 |
callnumber-search | QA166.3 |
callnumber-sort | QA 3166.3 |
callnumber-subject | QA - Mathematics |
classification_rvk | SK 170 SK 890 |
classification_tum | DAT 517f MAT 056f DAT 537f |
ctrlnum | (OCoLC)49554546 (DE-599)BVBBV014151361 |
dewey-full | 511.5 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.5 |
dewey-search | 511.5 |
dewey-sort | 3511.5 |
dewey-tens | 510 - Mathematics |
discipline | Informatik Mathematik |
edition | 1. ed. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02622nam a22007218c 4500</leader><controlfield tag="001">BV014151361</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20070301 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">020211s2002 gw ad|| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">963735381</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3528067624</subfield><subfield code="9">3-528-06762-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)49554546</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014151361</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166.3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="b">P944s 2002</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</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">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68R10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 056f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05C35</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q17</subfield><subfield code="2">msc</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">Hans Jürgen Prömel ; Angelika Steger</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Braunschweig [u.a.]</subfield><subfield code="b">Vieweg</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 241 S.</subfield><subfield code="b">Ill., graph. Darst.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Advanced lectures in mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bomen (wiskunde)</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafentheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Steiner, Systèmes de</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Steiner systems</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="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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2=" "><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">Verfasser</subfield><subfield code="0">(DE-588)170730433</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</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=009698726&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009698726</subfield></datafield></record></collection> |
id | DE-604.BV014151361 |
illustrated | Illustrated |
indexdate | 2024-07-09T18:58:35Z |
institution | BVB |
isbn | 3528067624 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009698726 |
oclc_num | 49554546 |
open_access_boolean | |
owner | DE-384 DE-29T DE-739 DE-91G DE-BY-TUM DE-92 DE-706 DE-20 DE-634 DE-83 DE-11 DE-188 |
owner_facet | DE-384 DE-29T DE-739 DE-91G DE-BY-TUM DE-92 DE-706 DE-20 DE-634 DE-83 DE-11 DE-188 |
physical | VII, 241 S. Ill., graph. Darst. |
publishDate | 2002 |
publishDateSearch | 2002 |
publishDateSort | 2002 |
publisher | Vieweg |
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 Hans Jürgen Prömel ; Angelika Steger 1. ed. Braunschweig [u.a.] Vieweg 2002 VII, 241 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Advanced lectures in mathematics Algorithmes Algoritmen gtt Bomen (wiskunde) gtt Complexité de calcul (Informatique) Grafentheorie gtt Graphes, Théorie des Steiner, Systèmes de Algorithms Computational complexity Graph theory Steiner systems Steiner-Problem (DE-588)4248342-6 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Steiner-Baum (DE-588)4228498-3 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Steiner-Problem (DE-588)4248342-6 s DE-604 Steiner-Baum (DE-588)4228498-3 s Algorithmus (DE-588)4001183-5 s Komplexitätstheorie (DE-588)4120591-1 s Steger, Angelika 1962- Verfasser (DE-588)170730433 aut GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009698726&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Prömel, Hans Jürgen 1953- Steger, Angelika 1962- The Steiner tree problem a tour through graphs, algorithms, and complexity Algorithmes Algoritmen gtt Bomen (wiskunde) gtt Complexité de calcul (Informatique) Grafentheorie gtt Graphes, Théorie des Steiner, Systèmes de Algorithms Computational complexity Graph theory Steiner systems Steiner-Problem (DE-588)4248342-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Steiner-Baum (DE-588)4228498-3 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4248342-6 (DE-588)4120591-1 (DE-588)4228498-3 (DE-588)4001183-5 |
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 Hans Jürgen Prömel ; Angelika Steger |
title_fullStr | The Steiner tree problem a tour through graphs, algorithms, and complexity Hans Jürgen Prömel ; Angelika Steger |
title_full_unstemmed | The Steiner tree problem a tour through graphs, algorithms, and complexity 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 | Algorithmes Algoritmen gtt Bomen (wiskunde) gtt Complexité de calcul (Informatique) Grafentheorie gtt Graphes, Théorie des Steiner, Systèmes de Algorithms Computational complexity Graph theory Steiner systems Steiner-Problem (DE-588)4248342-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Steiner-Baum (DE-588)4228498-3 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Algorithmes Algoritmen Bomen (wiskunde) Complexité de calcul (Informatique) Grafentheorie Graphes, Théorie des Steiner, Systèmes de Algorithms Computational complexity Graph theory Steiner systems Steiner-Problem Komplexitätstheorie Steiner-Baum Algorithmus |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009698726&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT promelhansjurgen thesteinertreeproblematourthroughgraphsalgorithmsandcomplexity AT stegerangelika thesteinertreeproblematourthroughgraphsalgorithmsandcomplexity |