Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2007
|
| Links: | 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. |
| Umfang: | 1 Online-Ressource (xv, 500 Seiten) |
| ISBN: | 9780511546884 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511546884 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020622.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 090508s2007||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511546884 | ||
| 100 | 1 | |a Narasimhan, Giri | |
| 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-Ressource (xv, 500 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 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. | ||
| 700 | 1 | |a Smid, Michiel | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521815130 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511546884 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511546884 |
|---|---|
| _version_ | 1832177784274812928 |
| adam_text | |
| any_adam_object | |
| author | Narasimhan, Giri |
| author2 | Smid, Michiel |
| author2_role | |
| author2_variant | m s ms |
| author_facet | Narasimhan, Giri Smid, Michiel |
| author_role | |
| author_sort | Narasimhan, Giri |
| author_variant | g n gn |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01719nam a2200253 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511546884</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020622.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">090508s2007||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511546884</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Narasimhan, Giri</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-Ressource (xv, 500 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</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="700" ind1="1" ind2=" "><subfield code="a">Smid, Michiel</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521815130</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511546884</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9780511546884 |
| illustrated | Not Illustrated |
| indexdate | 2025-05-15T09:21:35Z |
| institution | BVB |
| isbn | 9780511546884 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xv, 500 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Narasimhan, Giri Geometric spanner networks Giri Narasimhan, Michiel Smid Cambridge Cambridge University Press 2007 1 Online-Ressource (xv, 500 Seiten) txt c cr 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. Smid, Michiel Erscheint auch als Druck-Ausgabe 9780521815130 |
| spellingShingle | Narasimhan, Giri Geometric spanner networks |
| 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 |
| work_keys_str_mv | AT narasimhangiri geometricspannernetworks AT smidmichiel geometricspannernetworks |