skip to content
Geometric spanner networks Preview this item
ClosePreview this item
Checking...

Geometric spanner networks

Author: Giri Narasimhan; Michiel Smid
Publisher: Cambridge ; New York : Cambridge University Press, 2007.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
Narasimhan, Giri.
Geometric spanner networks.
Cambridge ; New York : Cambridge University Press, 2007
(DLC) 2006028718
(OCoLC)71237379
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Giri Narasimhan; Michiel Smid
ISBN: 9780511269943 0511269943 0511269382 9780511269387 9780511546884 0511546882
OCLC Number: 162023448
Description: 1 online resource (xv, 500 pages) : illustrations
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.
Responsibility: Giri Narasimhan, Michiel Smid.

Abstract:

Rigorous descriptions and analyses of the main algorithms for different variations of the Geometric Spanner Network Problem.  Read more...

Reviews

Editorial reviews

Publisher Synopsis

"The writing style is clear, with a clean presentation enriched with boxes highlighting important contents and figures." David Orden, Mathematical Reviews

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/162023448> # Geometric spanner networks
    a schema:CreativeWork, schema:Book, schema:MediaObject ;
    library:oclcnum "162023448" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/enk> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/58205002#Place/cambridge> ; # Cambridge
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    schema:about <http://dewey.info/class/005.1/e22/> ;
    schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
    schema:about <http://id.loc.gov/authorities/subjects/sh2008105182> ; # Geometry--Data processing
    schema:about <http://id.worldcat.org/fast/940870> ; # Geometry--Data processing
    schema:about <http://experiment.worldcat.org/entity/work/data/58205002#Topic/trees_graph_theory_data_processing> ; # Trees (Graph theory)--Data processing
    schema:about <http://experiment.worldcat.org/entity/work/data/58205002#Topic/computers_software_development_&_engineering_general> ; # COMPUTERS--Software Development & Engineering--General
    schema:about <http://experiment.worldcat.org/entity/work/data/58205002#Topic/computers_programming_open_source> ; # COMPUTERS--Programming--Open Source
    schema:about <http://id.worldcat.org/fast/1156139> ; # Trees (Graph theory)--Data processing
    schema:about <http://experiment.worldcat.org/entity/work/data/58205002#Topic/computers_software_development_&_engineering_tools> ; # COMPUTERS--Software Development & Engineering--Tools
    schema:bookFormat schema:EBook ;
    schema:contributor <http://viaf.org/viaf/69243057> ; # Michiel Smid
    schema:creator <http://viaf.org/viaf/20530608> ; # Giri Narasimhan
    schema:datePublished "2007" ;
    schema:description "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."@en ;
    schema:description "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."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/58205002> ;
    schema:genre "Electronic books"@en ;
    schema:inLanguage "en" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/71237379> ;
    schema:name "Geometric spanner networks"@en ;
    schema:productID "162023448" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/162023448#PublicationEvent/cambridge_new_york_cambridge_university_press_2007> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/58205002#Agent/cambridge_university_press> ; # Cambridge University Press
    schema:url <http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=185825> ;
    schema:url <http://www.SLQ.eblib.com.au/patron/FullRecord.aspx?p=288464> ;
    schema:url <http://www.myilibrary.com?id=75031&ref=toc> ;
    schema:url <http://www.myilibrary.com?id=75031> ;
    schema:url <http://dx.doi.org/10.1017/CBO9780511546884> ;
    schema:url <https://doi.org/10.1017/CBO9780511546884> ;
    schema:workExample <http://worldcat.org/isbn/9780511269943> ;
    schema:workExample <http://worldcat.org/isbn/9780511546884> ;
    schema:workExample <http://worldcat.org/isbn/9780511269387> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/162023448> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/58205002#Agent/cambridge_university_press> # Cambridge University Press
    a bgn:Agent ;
    schema:name "Cambridge University Press" ;
    .

<http://experiment.worldcat.org/entity/work/data/58205002#Topic/computers_programming_open_source> # COMPUTERS--Programming--Open Source
    a schema:Intangible ;
    schema:name "COMPUTERS--Programming--Open Source"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/58205002#Topic/computers_software_development_&_engineering_general> # COMPUTERS--Software Development & Engineering--General
    a schema:Intangible ;
    schema:name "COMPUTERS--Software Development & Engineering--General"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/58205002#Topic/computers_software_development_&_engineering_tools> # COMPUTERS--Software Development & Engineering--Tools
    a schema:Intangible ;
    schema:name "COMPUTERS--Software Development & Engineering--Tools"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/58205002#Topic/trees_graph_theory_data_processing> # Trees (Graph theory)--Data processing
    a schema:Intangible ;
    schema:hasPart <http://id.loc.gov/authorities/subjects/sh85137259> ;
    schema:name "Trees (Graph theory)--Data processing"@en ;
    .

<http://id.loc.gov/authorities/subjects/sh2008105182> # Geometry--Data processing
    a schema:Intangible ;
    schema:name "Geometry--Data processing"@en ;
    .

<http://id.worldcat.org/fast/1156139> # Trees (Graph theory)--Data processing
    a schema:Intangible ;
    schema:name "Trees (Graph theory)--Data processing"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
    schema:name "Computer algorithms"@en ;
    .

<http://id.worldcat.org/fast/940870> # Geometry--Data processing
    a schema:Intangible ;
    schema:name "Geometry--Data processing"@en ;
    .

<http://viaf.org/viaf/20530608> # Giri Narasimhan
    a schema:Person ;
    schema:familyName "Narasimhan" ;
    schema:givenName "Giri" ;
    schema:name "Giri Narasimhan" ;
    .

<http://viaf.org/viaf/69243057> # Michiel Smid
    a schema:Person ;
    schema:familyName "Smid" ;
    schema:givenName "Michiel" ;
    schema:name "Michiel Smid" ;
    .

<http://worldcat.org/isbn/9780511269387>
    a schema:ProductModel ;
    schema:isbn "0511269382" ;
    schema:isbn "9780511269387" ;
    .

<http://worldcat.org/isbn/9780511269943>
    a schema:ProductModel ;
    schema:isbn "0511269943" ;
    schema:isbn "9780511269943" ;
    .

<http://worldcat.org/isbn/9780511546884>
    a schema:ProductModel ;
    schema:isbn "0511546882" ;
    schema:isbn "9780511546884" ;
    .

<http://www.worldcat.org/oclc/71237379>
    a schema:CreativeWork ;
    rdfs:label "Geometric spanner networks." ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/162023448> ; # Geometric spanner networks
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.