Sciweavers

155 search results - page 4 / 31
» A New Necessary Condition for Shortest Path Routing
Sort
View
ITCC
2003
IEEE
14 years 18 days ago
Alternate Path Routing Algorithm for Traffic Engineering in the Internet
In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the...
Shyam Subramanian, Muthukumar Venkatesan
ESA
2005
Springer
155views Algorithms» more  ESA 2005»
14 years 26 days ago
Highway Hierarchies Hasten Exact Shortest Path Queries
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes n...
Peter Sanders, Dominik Schultes
TON
2002
138views more  TON 2002»
13 years 7 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
MUE
2008
IEEE
137views Multimedia» more  MUE 2008»
14 years 1 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...
FSTTCS
2004
Springer
14 years 22 days ago
Short-Cuts on Star, Source and Planar Unfoldings
When studying a 3D polyhedron, it is often easier to cut it open and atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
Vijay Chandru, Ramesh Hariharan, Narasimha M. Kris...