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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Giri Narasimhan earned a B.Tech. in Electrical Engineering from the Indian Institute of Technology in Mumbai, India, and a Ph.D. in Computer Science from the University of Wisconsin in Madison, Wisconsin, USA. He was a member of the faculty at the University of Memphis, and is currently at Florida International University.
Michiel Smid received a M.Sc. degree in Mathematics from the University of Technology in Eidenhoven and a Ph.D. degree in Computer Science from the University of Amsterdam. He has held teaching positions at the Max-Planck-Institute for Computer Science in Saarbrucken, King's College in London, and the University of Magdenburg. Since 2001, he has been at Carleton University, where he is currently a professor of Computer Science.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. Rigorous descriptions and analyses of the main algorithms for different variations of the Geometric Spanner Network Problem. Num Pages: 516 pages, Illustrations. BIC Classification: UT; UYA. Category: (P) Professional & Vocational. Dimension: 253 x 177 x 34. Weight in Grams: 1060. . 2007. hardcover. . . . . Books ship from the US and Ireland. N° de réf. du vendeur 9780521815130
Quantité disponible : 2 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. Rigorous descriptions and analyses of the main algorithms for different variations of the Geometric Spanner Network Problem. Num Pages: 516 pages, Illustrations. BIC Classification: UT; UYA. Category: (P) Professional & Vocational. Dimension: 253 x 177 x 34. Weight in Grams: 1060. . 2007. hardcover. . . . . N° de réf. du vendeur 9780521815130
Quantité disponible : 2 disponible(s)
Vendeur : Antártica, Madrid, M, Espagne
Cartoné (tapa dura cartón). Etat : New. Etat de la jaquette : Nuevo. 1. 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. LIBRO. N° de réf. du vendeur 888018
Quantité disponible : 3 disponible(s)
Vendeur : Powell's Bookstores Chicago, ABAA, Chicago, IL, Etats-Unis
Hardcover. Etat : Very Good. Paper-covered boards. Minor shelf wear. Else a bright, clean copy. 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. N° de réf. du vendeur 2041816
Quantité disponible : 1 disponible(s)
Vendeur : Powell's Bookstores Chicago, ABAA, Chicago, IL, Etats-Unis
Hardcover. Etat : Very Good. Paper-covered boards. Minor shelf wear. Else a bright, clean copy. 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. N° de réf. du vendeur 2054998
Quantité disponible : 1 disponible(s)
Vendeur : -OnTimeBooks-, Phoenix, AZ, Etats-Unis
Etat : good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail. N° de réf. du vendeur OTV.0521815134.G
Quantité disponible : 1 disponible(s)
Vendeur : Midtown Scholar Bookstore, Harrisburg, PA, Etats-Unis
hardcover. Etat : Good. Good hardcover with some shelfwear; may have previous owner's name inside. Standard-sized. N° de réf. du vendeur mon0000300904
Quantité disponible : 1 disponible(s)
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABBB-140619
Quantité disponible : 1 disponible(s)
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEOCT25-102169
Quantité disponible : 1 disponible(s)
Vendeur : Books Puddle, Woodside, NY, Etats-Unis
Etat : Used. pp. 516. N° de réf. du vendeur 26263938
Quantité disponible : 1 disponible(s)