CAAN
15 years 6 months ago
2007 Springer 
Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed...
118
click to vote
CAAN
15 years 4 months ago
2007 Springer 
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
CAAN
15 years 4 months ago
2007 Springer 
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
102
click to vote
CAAN
15 years 6 months ago
2007 Springer 
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
|
Discrete Geometry