Sciweavers

866 search results - page 51 / 174
» On Dynamic Shortest Paths Problems
Sort
View
ISCC
2002
IEEE
101views Communications» more  ISCC 2002»
14 years 17 days ago
Partial path protection for WDM networks: end-to-end recovery using local failure information
In this paper, we propose a new protection scheme, which we term partial path protection (PPP), to select endto-end backup paths using local information about network failures. PP...
Hungjen Wang, Eytan Modiano, Muriel Médard
SIAMDM
1998
55views more  SIAMDM 1998»
13 years 7 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu
MUE
2008
IEEE
137views Multimedia» more  MUE 2008»
14 years 2 months ago
Genetic Algorithm for Shortest Driving Time in Intelligent Transportation Systems
The route guidance system, which provides driving advice based on traffic information about an origin and a destination, has become very popular along with the advancement of hand...
Chu-Hsing Lin, Jui-Ling Yu, Jung-Chun Liu, Chia-Je...
FOCS
2009
IEEE
14 years 2 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
COCOON
2006
Springer
13 years 11 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...