Centrala begrepp
Improving Ramsey-type embeddings for hop-constrained networks.
Statistik
"Every n-point metric space could be embedded into distribution D over dominating trees with expected distortion O(log n)." - Chechik
"Every n-point weighted graph contains a subset M of at least n1− 1 k points." - Mendel and Naor
Citat
"Low-hop routes are more reliable and reduce transmission costs."
"Hop-constrained network approximation is used in parallel computing."
"Hop-constrained compact routing scheme aims to bound transmission delays and increase reliability."