83 search results - page 8 / 17 » On Bounded Leg Shortest Paths Problems |
127
click to vote
MST
2010
15 years 2 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
243
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
153
click to vote
ANOR
2008
15 years 4 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
137
click to vote
COMPGEOM
1994
ACM
15 years 8 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
126
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...