A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan...
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...