410 search results - page 14 / 82 » Upgrading Shortest Paths in Networks |
139
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
108
click to vote
CONEXT
2005
ACM
15 years 3 months ago
2005
ACM
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...
102
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
125
click to vote
CATA
2004
15 years 2 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
AICCSA
2006
IEEE
15 years 7 months ago
2006
IEEE
Multi-constraint quality-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the i...