Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Efficient solutions to some transportation problems with applications to minimizing robot arm travel
SIAM Journal on Computing
Introduction to algorithms
Preemptive ensemble motion planning on a tree
SIAM Journal on Computing
Nonpreemptive ensemble motion planning on a tree
Journal of Algorithms
Routing a vehicle of capacity greater than one
Discrete Applied Mathematics
The Online Dial-a-Ride Problem under Reasonable Load
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
| Hi-index | 0.00 |
In this paper we study algorithms for "Dial-a-Ride" transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to find a shortest transportation that serves all the jobs. This problem is known to be NP-hard even on trees. We consider the extension when precedence relations between the jobs with the same source are given. Our results include a polynomial time algorithm on paths and approximation algorithms general graphs and trees with performances of 9/4 and 5/3, respectively.