Competitive algorithms for server problems
Journal of Algorithms
A Graph-Theoretic Game and its Application to the $k$-Server Problem
SIAM Journal on Computing
On-line single-server dial-a-ride problems
Theoretical Computer Science
On-line algorithms for the dynamic traveling repair problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On-line k-Truck Problem and Its Competitive Algorithms
Journal of Global Optimization
Online Dial-a-Ride Problems: Minimizing the Completion Time
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On-Line Dial-a-Ride Problems under a Restricted Information Model
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The Online Dial-a-Ride Problem under Reasonable Load
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
News from the online traveling repairman
Theoretical Computer Science - Mathematical foundations of computer science
Online dial-a-ride problem with time-windows under a restricted information model
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
In this paper the first results on the Online Dial-A-Ride Problem with Time-Windows (ODARPTW for short) are presented. Requests for rides appearing over time consist of two points in a metric space, a source and a destination. Servers transport objects of requests from sources to destinations. Each request specifies a deadline. If a request is not be served by its deadline, it will be called off. The goal is to plan the motion of servers in an online way so that the maximum number of requests is met by their deadlines. We perform competitive analysis of two deterministic strategies for the problem with a single server in two cases separately, where the server has unit capacity and where the server has infinite capacity. The competitive ratios of the strategies are obtained. We also prove a lower bound on the competitive ratio of any deterministic algorithm of $\frac{2-T}{2T}$ for a server with unit capacity and of $\frac{2-T}{2T} \lceil \frac{1}{T} \rceil$ for a server with infinite capacity, where T denotes the diameter of the metric space.