632 search results - page 43 / 127 » On Routing in Circulant Graphs |
101
click to vote
TON
2010
14 years 8 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
CCECE
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper we investigate the limits of routing according to left- or righthand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits ...
OPODIS
2008
14 years 11 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
HEURISTICS
2008
14 years 10 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...