Sciweavers

364 search results - page 4 / 73
» Shortest-path network interdiction
Sort
View
DATESO
2009
114views Database» more  DATESO 2009»
13 years 5 months ago
Speeding Up Shortest Path Search in Public Transport Networks
Abstract. The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that sp...
Vladislav Martinek, Michal Zemlicka
CPAIOR
2009
Springer
14 years 2 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
ISAAC
2003
Springer
92views Algorithms» more  ISAAC 2003»
14 years 20 days ago
Wavelength Conversion in Shortest-Path All-Optical Networks
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...
Thomas Erlebach, Stamatis Stefanakos
JSAC
2006
108views more  JSAC 2006»
13 years 7 months ago
Distributed Utility Maximization for Network Coding Based Multicasting: A Shortest Path Approach
One central issue in practically deploying network coding is the adaptive and economic allocation of network resource. We cast this as an optimization, where the net-utility
Yunnan Wu, Sun-Yuan Kung