Sciweavers

364 search results - page 3 / 73
» Shortest-path network interdiction
Sort
View
NETWORKS
2006
13 years 7 months ago
The approach-dependent, time-dependent, label-constrained shortest path problem
Hanif D. Sherali, Chawalit Jeenanunta, Antoine G. ...
PVLDB
2010
269views more  PVLDB 2010»
13 years 5 months ago
Shortest Path Computation on Air Indexes
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
Georgios Kellaris, Kyriakos Mouratidis
GIS
2010
ACM
13 years 6 months ago
A case for time-dependent shortest path computation in spatial networks
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
NETWORKS
2007
13 years 7 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
ICC
2011
IEEE
217views Communications» more  ICC 2011»
12 years 7 months ago
A Distributed Algorithm for Multi-Constrained Anypath Routing in Wireless Mesh Networks
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
Xi Fang, Dejun Yang, Guoliang Xue