763 search results - page 90 / 153 » Engineering Shortest Path Algorithms |
153
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
142
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
161
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
178
click to vote
SDM
2012
SIAM
13 years 8 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
164
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
— This paper presents a new mechanism for improving the convergence properties of path vector routing algorithms, such as BGP. Using a route’s path information, we develop two ...