9 search results - page 2 / 2 » A 1.5-approximation algorithm for augmenting edge-connectivi... |
SWAT
2010
Springer
13 years 3 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
PDCAT
2005
Springer
13 years 10 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
ICRA
2008
IEEE
13 years 11 months ago
2008
IEEE
— Image-based navigation paradigms have recently emerged as an interesting alternative to conventional modelbased methods in mobile robotics. In this paper, we augment the existi...