Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k MST problem (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A 2.5-factor approximation algorithm for the k-MST problem
Information Processing Letters
Online computation and competitive analysis
Online computation and competitive analysis
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
SIAM Journal on Computing
On-line single-server dial-a-ride problems
Theoretical Computer Science
On-line algorithms for the dynamic traveling repair problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
Approximation Algorithms for Orienteering and Discounted-Reward TSP
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios
Transportation Science
Particle swarm optimization-based algorithms for TSP and generalized TSP
Information Processing Letters
The on-line asymmetric traveling salesman problem
Journal of Discrete Algorithms
The online Prize-Collecting Traveling Salesman Problem
Information Processing Letters
On the power of lookahead in on-line server routing problems
Theoretical Computer Science
Online decision making and automatic decision model adaptation
Computers and Operations Research
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
Online traveling salesman problem with deadline and advanced information
Computers and Industrial Engineering
| Hi-index | 0.89 |
The Quota Traveling Salesman Problem is a generalization of the well-known Traveling Salesman Problem. The goal of the traveling salesman is, in this case, to reach a given quota of sales, minimizing the amount of time. In this paper we address the on-line version of the problem, where requests are given over time. We present algorithms for various metric spaces, and analyze their performance in the usual framework of competitive analysis. In particular we present a 2-competitive algorithm that matches the lower bound for general metric spaces. In the case of the halfline metric space, we show that it is helpful not to move at full speed, and this approach is also used to derive the best on-line polynomial time algorithm known so far for the On-Line TSP (in the homing version).