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
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
Algorithms for the on-line quota traveling salesman problem
Information Processing Letters
An O(log n) approximation ratio for the asymmetric traveling salesman path problem
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
On the power of lookahead in on-line server routing problems
Theoretical Computer Science
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Are Stacker Crane Problems easy? A statistical study
Computers and Operations Research
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 3+52-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 depends 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.