000			02973nam a22003618i 4500
001			CR9780511546884
003			UkCbUP
005			20200124160327.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			090508s2007||||enk o ||1 0|eng|d
020			_a9780511546884 (ebook)
020			_z9780521815130 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA76.9.A43 _bN37 2007
082	0	0	_a005.1 _222
100	1		_aNarasimhan, Giri, _eauthor.
245	1	0	_aGeometric spanner networks / _cGiri Narasimhan, Michiel Smid.
264		1	_aCambridge : _bCambridge University Press, _c2007.
300			_a1 online resource (xv, 500 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505	0		_aAlgorithms 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			_aAimed 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	_aComputer algorithms.
650		0	_aTrees (Graph theory) _xData processing.
650		0	_aGeometry _xData processing.
700	1		_aSmid, Michiel, _eauthor.
776	0	8	_iPrint version: _z9780521815130
856	4	0	_uhttps://doi.org/10.1017/CBO9780511546884
999			_c522239 _d522237