832 search results - page 14 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
111
Voted
EOR
2007
15 years 12 days ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
130
click to vote
ISPAN
2005
IEEE
15 years 6 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
CCCG
2007
15 years 1 months ago
2007
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
107
Voted
PODC
2006
ACM
15 years 6 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
103
Voted
ESA
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...