Sciweavers

364 search results - page 12 / 73
» Shortest-path network interdiction
Sort
View
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
AICCSA
2006
IEEE
126views Hardware» more  AICCSA 2006»
14 years 1 months ago
Restricted Shortest Path Routing with Concave Costs
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...
Pejman Khadivi, Shadrokh Samavi, Hossein Saidi
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 11 months ago
A new approach for shortest path routing problem by random key-based GA
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...
Mitsuo Gen, Lin Lin
CATA
2004
13 years 9 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
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...
Fred J. Rispoli, Steven Cosares
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
13 years 7 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
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...
Jop Briët, Sourav Chakraborty, David Garc&iac...