Sparse communication networks and efficient routing in the plane

Distributed Computing

Volumn 14, Issue 4, 2001, Pages 205-215

  Hassin, Yehuda ^a   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Communication networks; Geometric spanners; Routing schemes

Indexed keywords

ELECTRIC NETWORK TOPOLOGY; OPTIMIZATION; ROUTERS; TELECOMMUNICATION LINKS;

GEOMETRIC SPANNERS;

TELECOMMUNICATION NETWORKS;

EID: 0035658561     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460100054     Document Type: Article

References (14)

1. On sparse spanners of weighted graphs
2. Efficient construction of a bounded-degree spanner with low weight
3. Euclidean spanners: Short, thin, and lanky
4. Randomized and deterministic algorithms for geometric spanners of small diameter
5. Routing with polynomial communication-space trade-off
6. A distance routing effect algorithm for mobility (dream)
7. There is a planar graph almost as good as the complete graph
8. Delaunay graphs are almost as good as complete graphs
9. Memory requirement for universal routing schemes
10. Classes of graphs which approximate the complete Euclidean graph
11. Compass routing on geometric networks
12. Labelling and implicit routing in networks
13. Approximating Euclidean distances by small degree graphs