On the power of lookahead in on-line server routing problems

Authors:
Luca Allulli;Giorgio Ausiello;Vincenzo Bonifaci;Luigi Laura
Affiliations:
Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Via Ariosto 25, 00185 Roma, Italy;Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Via Ariosto 25, 00185 Roma, Italy;Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Via Ariosto 25, 00185 Roma, Italy and Dipartimento di Ingegneria Elettrica, Università dellAquila, Monteluco di R ...;Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Via Ariosto 25, 00185 Roma, Italy
Venue:
Theoretical Computer Science
Year:
2008

Citing 17
Cited 3

Amortized efficiency of list update and paging rules

Communications of the ACM
A competitive analysis of the list update problem with lookahead

Theoretical Computer Science
Online computation and competitive analysis

Online computation and competitive analysis
An improved approximation ratio for the minimum latency problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Adversarial queuing theory

Journal of the ACM (JACM)
On-line single-server dial-a-ride problems

Theoretical Computer Science
Beyond Competitive Analysis

SIAM Journal on Computing
The Minimum Latency Problem Is NP-Hard for Weighted Trees

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
The Online TSP Against Fair Adversaries

INFORMS Journal on Computing
A 3-approximation for the minimum tree spanning k vertices

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Algorithms for the on-line quota traveling salesman problem

Information Processing Letters
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios

Transportation Science
Note: An adversarial queueing model for online server routing

Theoretical Computer Science
The on-line asymmetric traveling salesman problem

Journal of Discrete Algorithms
Online k-Server Routing Problems

Theory of Computing Systems
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 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 traveling salesman problem with deadline and advanced information

Computers and Industrial Engineering
How much is it worth to know the future in online conversion problems?

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study the usefulness of lookahead in on-line server routing problems: if an on-line algorithm is not only informed about the requests released so far, but also has a limited ability to foresee future requests, what is the improvement that can be achieved in terms of the competitive ratio? We consider several on-line server routing problems in this setting, such as the on-line traveling salesman and the on-line traveling repairman problem. We show that the influence of lookahead can change considerably depending on the particular objective function and metric space considered.