Back to Results
First PageMeta Content
Distributed data storage / Routing / Distributed hash table / Shortest path problem / Travelling salesman problem / Tree decomposition / Koorde / Pastry / Graph theory / Theoretical computer science / Mathematics


Distance Estimation and Object Location via Rings of Neighbors ∗ Aleksandrs Slivkins† February 2005 Revised: June 2005, Nov 2005, April 2006, SeptAbstract
Add to Reading List

Document Date: 2006-09-17 17:37:38

Open Document

File Size: 256,37 KB

Share Result on Facebook

Company

Preliminaries / /

Facility

Cornell University / Brown University / /

IndustryTerm

Internet distance matrix / non-greedy routing algorithms / greedy routing algorithm / non-greedy algorithms / Internet latencies / local routing algorithm / overlay network / greedy algorithm / searchable small-world networks / all-pairs shortest paths algorithm / /

Organization

Brown University / Department of Computer Science / Cornell University / /

Person

Jon Kleinberg / Bt / /

Position

model / salesman / /

Technology

greedy algorithm / non-greedy routing algorithms / all-pairs shortest paths algorithm / distributed algorithm / non-greedy algorithms / greedy routing algorithm / peer-to-peer / strongly local routing algorithm / routing algorithm / /

SocialTag