Geometric spanner networks:
Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geometric analysis techniques with many applications, p...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2007
|
| Schlagwörter: | |
| Links: | https://doi.org/10.1017/CBO9780511546884 https://doi.org/10.1017/CBO9780511546884 https://doi.org/10.1017/CBO9780511546884 |
| Zusammenfassung: | Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geometric analysis techniques with many applications, practical and theoretical. The authors present rigorous descriptions of the main algorithms and their analyses for different variations of the Geometric Spanner Network Problem. Though the basic ideas behind most of these algorithms are intuitive, very few are easy to describe and analyze. For most of the algorithms, nontrivial data structures need to be designed, and nontrivial techniques need to be developed in order for analysis to take place. Still, there are several basic principles and results that are used throughout the book. One of the most important is the powerful well-separated pair decomposition. This decomposition is used as a starting point for several of the spanner constructions |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Umfang: | 1 online resource (xv, 500 pages) |
| ISBN: | 9780511546884 |
| DOI: | 10.1017/CBO9780511546884 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043945469 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2007 xx o|||| 00||| eng d | ||
| 020 | |a 9780511546884 |c Online |9 978-0-511-54688-4 | ||
| 024 | 7 | |a 10.1017/CBO9780511546884 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511546884 | ||
| 035 | |a (OCoLC)850628859 | ||
| 035 | |a (DE-599)BVBBV043945469 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 005.1 |2 22 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 100 | 1 | |a Narasimhan, Giri |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Geometric spanner networks |c Giri Narasimhan, Michiel Smid |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2007 | |
| 300 | |a 1 online resource (xv, 500 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a Algorithms and graphs -- The algebraic computation-tree model -- Spanners based on the q-graph -- Cones in higher dimensional space and q-graphs -- Geometric analysis : the gap property -- The gap-greedy algorithm -- Enumerating distances using spanners of bounded degree -- The well-separated pair decomposition -- Applications of well-separated pairs -- The dumbbell theorem -- Shortcutting trees and spanners with low spanner diameter -- Approximating the stretch factor of euclidean graphs -- Geometric analysis : the leapfrog property -- The path-greedy algorithm -- The distance range hierarchy -- Approximating shortest paths in spanners -- Fault-tolerant spanners -- Designing approximation algorithms with spanners -- Further results and open problems | |
| 520 | |a Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geometric analysis techniques with many applications, practical and theoretical. The authors present rigorous descriptions of the main algorithms and their analyses for different variations of the Geometric Spanner Network Problem. Though the basic ideas behind most of these algorithms are intuitive, very few are easy to describe and analyze. For most of the algorithms, nontrivial data structures need to be designed, and nontrivial techniques need to be developed in order for analysis to take place. Still, there are several basic principles and results that are used throughout the book. One of the most important is the powerful well-separated pair decomposition. This decomposition is used as a starting point for several of the spanner constructions | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Trees (Graph theory) / Data processing | |
| 650 | 4 | |a Geometry / Data processing | |
| 650 | 0 | 7 | |a Spannender Baum |0 (DE-588)4761178-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 0 | 1 | |a Spannender Baum |0 (DE-588)4761178-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Smid, Michiel |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-81513-0 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511546884 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-029354440 | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511546884 |l DE-12 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511546884 |l DE-92 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1818982577042620416 |
|---|---|
| any_adam_object | |
| author | Narasimhan, Giri |
| author_facet | Narasimhan, Giri |
| author_role | aut |
| author_sort | Narasimhan, Giri |
| author_variant | g n gn |
| building | Verbundindex |
| bvnumber | BV043945469 |
| classification_rvk | SK 890 ST 134 ST 600 |
| collection | ZDB-20-CBO |
| contents | Algorithms and graphs -- The algebraic computation-tree model -- Spanners based on the q-graph -- Cones in higher dimensional space and q-graphs -- Geometric analysis : the gap property -- The gap-greedy algorithm -- Enumerating distances using spanners of bounded degree -- The well-separated pair decomposition -- Applications of well-separated pairs -- The dumbbell theorem -- Shortcutting trees and spanners with low spanner diameter -- Approximating the stretch factor of euclidean graphs -- Geometric analysis : the leapfrog property -- The path-greedy algorithm -- The distance range hierarchy -- Approximating shortest paths in spanners -- Fault-tolerant spanners -- Designing approximation algorithms with spanners -- Further results and open problems |
| ctrlnum | (ZDB-20-CBO)CR9780511546884 (OCoLC)850628859 (DE-599)BVBBV043945469 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1017/CBO9780511546884 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03898nam a2200553zc 4500</leader><controlfield tag="001">BV043945469</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2007 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511546884</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-54688-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511546884</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511546884</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)850628859</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043945469</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</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">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 600</subfield><subfield code="0">(DE-625)143681:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Narasimhan, Giri</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Geometric spanner networks</subfield><subfield code="c">Giri Narasimhan, Michiel Smid</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xv, 500 pages)</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="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Algorithms and graphs -- The algebraic computation-tree model -- Spanners based on the q-graph -- Cones in higher dimensional space and q-graphs -- Geometric analysis : the gap property -- The gap-greedy algorithm -- Enumerating distances using spanners of bounded degree -- The well-separated pair decomposition -- Applications of well-separated pairs -- The dumbbell theorem -- Shortcutting trees and spanners with low spanner diameter -- Approximating the stretch factor of euclidean graphs -- Geometric analysis : the leapfrog property -- The path-greedy algorithm -- The distance range hierarchy -- Approximating shortest paths in spanners -- Fault-tolerant spanners -- Designing approximation algorithms with spanners -- Further results and open problems</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geometric analysis techniques with many applications, practical and theoretical. The authors present rigorous descriptions of the main algorithms and their analyses for different variations of the Geometric Spanner Network Problem. Though the basic ideas behind most of these algorithms are intuitive, very few are easy to describe and analyze. For most of the algorithms, nontrivial data structures need to be designed, and nontrivial techniques need to be developed in order for analysis to take place. Still, there are several basic principles and results that are used throughout the book. One of the most important is the powerful well-separated pair decomposition. This decomposition is used as a starting point for several of the spanner constructions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory) / Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry / Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Spannender Baum</subfield><subfield code="0">(DE-588)4761178-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Spannender Baum</subfield><subfield code="0">(DE-588)4761178-9</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="700" ind1="1" ind2=" "><subfield code="a">Smid, Michiel</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</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-0-521-81513-0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511546884</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029354440</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511546884</subfield><subfield code="l">DE-12</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</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.1017/CBO9780511546884</subfield><subfield code="l">DE-92</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043945469 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T17:49:25Z |
| institution | BVB |
| isbn | 9780511546884 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029354440 |
| oclc_num | 850628859 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xv, 500 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Narasimhan, Giri Verfasser aut Geometric spanner networks Giri Narasimhan, Michiel Smid Cambridge Cambridge University Press 2007 1 online resource (xv, 500 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) Algorithms and graphs -- The algebraic computation-tree model -- Spanners based on the q-graph -- Cones in higher dimensional space and q-graphs -- Geometric analysis : the gap property -- The gap-greedy algorithm -- Enumerating distances using spanners of bounded degree -- The well-separated pair decomposition -- Applications of well-separated pairs -- The dumbbell theorem -- Shortcutting trees and spanners with low spanner diameter -- Approximating the stretch factor of euclidean graphs -- Geometric analysis : the leapfrog property -- The path-greedy algorithm -- The distance range hierarchy -- Approximating shortest paths in spanners -- Fault-tolerant spanners -- Designing approximation algorithms with spanners -- Further results and open problems Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geometric analysis techniques with many applications, practical and theoretical. The authors present rigorous descriptions of the main algorithms and their analyses for different variations of the Geometric Spanner Network Problem. Though the basic ideas behind most of these algorithms are intuitive, very few are easy to describe and analyze. For most of the algorithms, nontrivial data structures need to be designed, and nontrivial techniques need to be developed in order for analysis to take place. Still, there are several basic principles and results that are used throughout the book. One of the most important is the powerful well-separated pair decomposition. This decomposition is used as a starting point for several of the spanner constructions Datenverarbeitung Computer algorithms Trees (Graph theory) / Data processing Geometry / Data processing Spannender Baum (DE-588)4761178-9 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 s Spannender Baum (DE-588)4761178-9 s 1\p DE-604 Smid, Michiel Sonstige oth Erscheint auch als Druckausgabe 978-0-521-81513-0 https://doi.org/10.1017/CBO9780511546884 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Narasimhan, Giri Geometric spanner networks Algorithms and graphs -- The algebraic computation-tree model -- Spanners based on the q-graph -- Cones in higher dimensional space and q-graphs -- Geometric analysis : the gap property -- The gap-greedy algorithm -- Enumerating distances using spanners of bounded degree -- The well-separated pair decomposition -- Applications of well-separated pairs -- The dumbbell theorem -- Shortcutting trees and spanners with low spanner diameter -- Approximating the stretch factor of euclidean graphs -- Geometric analysis : the leapfrog property -- The path-greedy algorithm -- The distance range hierarchy -- Approximating shortest paths in spanners -- Fault-tolerant spanners -- Designing approximation algorithms with spanners -- Further results and open problems Datenverarbeitung Computer algorithms Trees (Graph theory) / Data processing Geometry / Data processing Spannender Baum (DE-588)4761178-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd |
| subject_GND | (DE-588)4761178-9 (DE-588)4130267-9 |
| title | Geometric spanner networks |
| title_auth | Geometric spanner networks |
| title_exact_search | Geometric spanner networks |
| title_full | Geometric spanner networks Giri Narasimhan, Michiel Smid |
| title_fullStr | Geometric spanner networks Giri Narasimhan, Michiel Smid |
| title_full_unstemmed | Geometric spanner networks Giri Narasimhan, Michiel Smid |
| title_short | Geometric spanner networks |
| title_sort | geometric spanner networks |
| topic | Datenverarbeitung Computer algorithms Trees (Graph theory) / Data processing Geometry / Data processing Spannender Baum (DE-588)4761178-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd |
| topic_facet | Datenverarbeitung Computer algorithms Trees (Graph theory) / Data processing Geometry / Data processing Spannender Baum Algorithmische Geometrie |
| url | https://doi.org/10.1017/CBO9780511546884 |
| work_keys_str_mv | AT narasimhangiri geometricspannernetworks AT smidmichiel geometricspannernetworks |