Sciweavers

763 search results - page 2 / 153
» Engineering Shortest Path Algorithms
Sort
View
PAAPP
1998
149views more  PAAPP 1998»
13 years 7 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 9 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi
WEA
2005
Springer
194views Algorithms» more  WEA 2005»
14 years 1 months ago
Acceleration of Shortest Path and Constrained Shortest Path Computation
Ekkehard Köhler, Rolf H. Möhring, Heiko ...
GLOBECOM
2007
IEEE
14 years 1 months ago
LSP Setup Arrival Reordering Approach for MPLS-TE Routing
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
Imène Chaieb, Jean-Louis Le Roux, Bernard C...
IEEEPACT
2006
IEEE
14 years 1 months ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...