Efficient solutions to some transportation problems with applications to minimizing robot arm travel
SIAM Journal on Computing
Nonpreemptive ensemble motion planning on a tree
Journal of Algorithms
Scheduling Parallel Machines On-line
SIAM Journal on Computing
Approximability and nonapproximability results for minimizing total flow time on a single machine
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
On-line single-server dial-a-ride problems
Theoretical Computer Science
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Online Dial-a-Ride Problems: Minimizing the Completion Time
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Developments from a June 1996 seminar on Online algorithms: the state of the art
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
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
On minimizing the maximum flow time in the online dial-a-ride problem
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
On-Line algorithms, real time, the virtue of laziness, and the power of clairvoyance
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On the online dial-a-ride problem with time-windows
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Online k-server routing problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
In this paper, we analyze algorithms for the online dial-aride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in a sufficiently large time period can be served in a time period of at most the same length. This new notion is a stability criterion implying that the system is not overloaded. The new concept is used to analyze the online dial-a-ride problem for the minimization of the maximal resp. average flow time. Under reasonable load it is possible to distinguish the performance of two particular algorithms for this problem, which seems to be impossible by means of classical competitive analysis.