Sciweavers

763 search results - page 14 / 153
» Engineering Shortest Path Algorithms
Sort
View
TEC
2002
117views more  TEC 2002»
15 years 4 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
CCCG
2010
15 years 5 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
ACSC
2007
IEEE
15 years 10 months ago
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
Lin Tian, Tadao Takaoka
ESA
1995
Springer
102views Algorithms» more  ESA 1995»
15 years 8 months ago
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
Kurt Mehlhorn, Volker Priebe
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
15 years 5 months ago
Experimental analysis of dynamic all pairs shortest path algorithms
Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. I...