Amortized efficiency of list update and paging rules
Communications of the ACM
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Online computation and competitive analysis
Online computation and competitive analysis
P-Complete Approximation Problems
Journal of the ACM (JACM)
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
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 TSP Against Fair Adversaries
INFORMS Journal on Computing
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
ACM SIGACT News
Online chasing problems for regular polygons
Information Processing Letters
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
Online k-server routing problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Hi-index | 0.00 |
We consider two on-line versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a $\frac{3\sqrt{5}}{2}$ -competitive algorithm and prove that this is best possible. For the nomadic version, the on-line analogue of the shortest asymmetric hamiltonian path problem, we show that the competitive ratio of any on-line algorithm has to depend on the amount of asymmetry of the space in which the salesman moves. We also give bounds on the competitive ratio of on-line algorithms that are zealous, that is, in which the salesman cannot stay idle when some city can be served.