353 search results - page 5 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
ICCTA
2007
IEEE
13 years 11 months ago
2007
IEEE
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
CCCG
2010
13 years 9 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...