Randomized algorithms
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
News from the Online Traveling Repairman
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Online Dial-a-Ride Problems: Minimizing the Completion Time
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Online Dial-a-Ride Problem under Reasonable Load
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The Online TSP Against Fair Adversaries
INFORMS Journal on Computing
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Beyond competitive analysis [on-line algorithms]
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Theoretical Computer Science - Approximation and online algorithms
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science
Note: An adversarial queueing model for online server routing
Theoretical Computer Science
New policies for the dynamic traveling salesman problem
Optimization Methods & Software
On the power of lookahead in on-line server routing problems
Theoretical Computer Science
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
ASAP: The After-Salesman Problem
Manufacturing & Service Operations Management
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 the power of lookahead in on-line vehicle routing problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
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 the online traveling salesman problem OLTSP requests for visits to cities arrive online while the salesman is traveling. We study the Fmax-OLTSP where the objective is to minimize the maximum flow time. This objective is particularly interesting for applications. Unfortunately, there can be no competitive algorithm, neither deterministic nor randomized. Hence, competitive analysis fails to distinguish online algorithms. Not even resource augmentation which is helpful in scheduling works as a remedy. This unsatisfactory situation motivates the search for alternative analysis methods.We introduce a natural restriction on the adversary for the Fmax-OLTSP on the real line. A non-abusive adversary may only move in a direction if there are yet unserved requests on this side. Our main result is an algorithm which achieves a constant competitive ratio against the nonabusive adversary.