177 search results - page 6 / 36 » Link Distance and Shortest Path Problems in the Plane |
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
ICALP
1995
Springer
14 years 4 days ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— Minimum distance localization is the problem of ï¬nding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog†puzzle. The ï¬rst version (the “asteroid surveying†problem) is set in three dimensions and asks for the sh...
NETWORKS
2007
13 years 8 months ago
2007
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...