Presents rigorous descriptions and analyses of the main algorithms for different variations of the Geometric Spanner Network Problem. One of the most important basic principles covered in this book is the powerful well-separated pair decomposition, which is used as a starting point for several of the spanner constructions.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
Hardcover. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Nº de ref. del artículo: S_424972365
Cantidad disponible: 1 disponibles
Librería: Midtown Scholar Bookstore, Harrisburg, PA, Estados Unidos de America
hardcover. Condición: Good. Good hardcover with some shelfwear; may have previous owner's name inside. Standard-sized. Nº de ref. del artículo: mon0000300904
Cantidad disponible: 1 disponibles
Librería: Powell's Bookstores Chicago, ABAA, Chicago, IL, Estados Unidos de America
Condición: Used - Very Good. 2007. Hardcover. Library binding. No dj. Some shelf-wear. Very Good. Nº de ref. del artículo: SON000001327
Cantidad disponible: 1 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 516. Nº de ref. del artículo: 26263938
Cantidad disponible: 1 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. pp. 516 Illus. Nº de ref. del artículo: 7583965
Cantidad disponible: 1 disponibles
Librería: Antártica, Madrid, M, España
Cartoné (tapa dura cartón). Condición: New. Estado de la sobrecubierta: 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 ref. del artículo: 888018
Cantidad disponible: 3 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. pp. 516. Nº de ref. del artículo: 18263944
Cantidad disponible: 1 disponibles
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Nº de ref. del artículo: ABEOCT25-102168
Cantidad disponible: 3 disponibles
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Condición: 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 ref. del artículo: ABNR-180373
Cantidad disponible: 1 disponibles
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Condición: 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 ref. del artículo: ABNR-140009
Cantidad disponible: 1 disponibles