network routing protocols / linear set union algorithm / adaptive distributed routing algorithm / on-line product queries / proximity search / wireless ad-hoc networks / sparse networks / mobile wireless networks / nearest neighbor search / /
OperatingSystem
Xp / /
Organization
National Science Foundation / Carnegie Mellon University / Pittsburgh / J. Assoc. / Computer Science Department / /
Person
Jeffrey S. Salowe / Anupam Gupta / Ittai Abraham / Dahlia Malkhi / Jos / David R. Karger / David Dobkin / James R. Lee / M. Scott Corson / Elizabeth M. Belding-Royer / Ingo Alth / Gautam Das / Deborah Joseph / Bruce M. Maggs / Robert Krauthgamer / Matthias Ruhl / S. Rao Kosaraju / Michiel H. M. Smid / Pravin Bhagwat / Paul B. Callahan / Sunil Arya / Chandra / Patrice Assouad / Andrew C. Yao / Shuheng Zhou / Vincent D. Park / H. Chan / Charles E. Perkins / Bernard Chazelle / /
Position
straight-forward / General / /
ProvinceOrState
Pennsylvania / New York / /
PublishedMedium
the Theory of Computing / Theory of Computing / /
Technology
linear set union algorithm / adaptive distributed routing algorithm / network routing protocols / /
Small Hop-diameter Sparse Spanners for Doubling Metrics∗ T-H. Hubert Chan Abstract Given a metric M = (V, d), a graph G = (V, E) is a t-spanner for M if every pair of nodes in V has a “short” path (i.e., of length