Sciweavers

422 search results - page 6 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
ICDCS
2011
IEEE
12 years 7 months ago
The Routing Continuum from Shortest-Path to All-Path: A Unifying Theory
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
Yanhua Li, Zhi-Li Zhang, Daniel Boley
ISVD
2007
IEEE
14 years 1 months ago
Time Convex Hull with a Highway
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
Teng-Kai Yu, D. T. Lee
PUK
2003
13 years 8 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
COCOON
1999
Springer
13 years 11 months ago
On Routing in Circulant Graphs
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
CCCG
2003
13 years 8 months ago
On shortest paths in line arrangements
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectu...
Telikepalli Kavitha, Kasturi R. Varadarajan