832 search results - page 4 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
INFOCOM
2002
IEEE
14 years 2 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
COLING
2008
13 years 11 months ago
2008
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
CATA
2004
13 years 11 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
ESA
2000
Springer
14 years 1 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
CCCG
2010
13 years 11 months ago
2010
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...