GD
2001
Springer
14 years 3 months ago
2001
Springer
We prove that every tree T = (V, E) on n vertices with edges of unit length can be embedded in the plane with distortion O( √ n); that is, we construct a mapping f: V → R2 suc...
AAIM
2009
Springer
14 years 5 months ago
2009
Springer
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...