Geometric spanner networks / (Record no. 522239)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02973nam a22003618i 4500 |
| 001 - CONTROL NUMBER | |
| control field | CR9780511546884 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | UkCbUP |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200124160327.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION | |
| fixed length control field | m|||||o||d|||||||| |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr|||||||||||| |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 090508s2007||||enk o ||1 0|eng|d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780511546884 (ebook) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Cancelled/invalid ISBN | 9780521815130 (hardback) |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | UkCbUP |
| Language of cataloging | eng |
| Description conventions | rda |
| Transcribing agency | UkCbUP |
| 050 00 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA76.9.A43 |
| Item number | N37 2007 |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| Edition number | 22 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Narasimhan, Giri, |
| Relator term | author. |
| 245 10 - TITLE STATEMENT | |
| Title | Geometric spanner networks / |
| Statement of responsibility, etc | Giri Narasimhan, Michiel Smid. |
| 264 #1 - Production, Publication, Distribution, Manufacture, and Copyright Notice (R) | |
| Place of production, publication, distribution, manufacture (R) | Cambridge : |
| Name of producer, publisher, distributor, manufacturer (R) | Cambridge University Press, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2007. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource (xv, 500 pages) : |
| Other physical details | digital, PDF file(s). |
| 336 ## - Content Type (R) | |
| Content type term (R) | text |
| Content type code (R) | txt |
| Source (NR) | rdacontent |
| 337 ## - Media Type (R) | |
| Media type term (R) | computer |
| Media type code (R) | c |
| Source (NR) | rdamedia |
| 338 ## - Carrier Type (R) | |
| Carrier type term (R) | online resource |
| Carrier type code (R) | cr |
| Source (NR) | rdacarrier |
| 500 ## - GENERAL NOTE | |
| General note | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 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 ## - SUMMARY, ETC. | |
| Summary, etc | 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 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Trees (Graph theory) |
| General subdivision | Data processing. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Geometry |
| General subdivision | Data processing. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Smid, Michiel, |
| Relator term | author. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Print version: |
| International Standard Book Number | 9780521815130 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1017/CBO9780511546884">https://doi.org/10.1017/CBO9780511546884</a> |
No items available.