The online Prize-Collecting Traveling Salesman Problem

Information Processing Letters

Volumn 107, Issue 6, 2008, Pages 199-204

  Ausiello, Giorgio ^a   Bonifaci, Vincenzo ^a,b   Laura, Luigi ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Analysis of algorithms; Combinatorial problems; On line algorithms

Indexed keywords

APPROXIMATION ALGORITHMS; BOOLEAN FUNCTIONS; CONTROL THEORY; LAWS AND LEGISLATION; MILITARY DATA PROCESSING; PLATES (STRUCTURAL COMPONENTS); POLYNOMIAL APPROXIMATION;

COMPETITIVE RATIOS; ELSEVIER (CO); IN ORDER; LOWER BOUNDS; POLYNOMIAL-TIME; TRAVELING SALESMAN; TRAVELING SALESMAN PROBLEM (TSP);

TRAVELING SALESMAN PROBLEM;

EID: 47549090074     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.03.002     Document Type: Article

References (12)

1. Ascheuer N., Krumke S.O., and Rambau J. Online dial-a-ride problems: Minimizing the completion time. In: Reichel H., and Tison S. (Eds). Proc. 17th Symp. on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science vol. 1770 (2000), Springer-Verlag 639-650
2. Ausiello G., Leonardi S., and Marchetti-Spaccamela A. On salesmen, repairmen, spiders, and other traveling agents. In: Bongiovanni G., Gambosi G., and Petreschi R. (Eds). Proc. 4th Italian Conf. on Algorithms and Complexity. Lecture Notes in Computer Science vol. 1767 (2000), Springer-Verlag 1-16
3. Ausiello G., Feuerstein E., Leonardi S., Stougie L., and Talamo M. Algorithms for the on-line travelling salesman. Algorithmica 29 4 (2001) 560-581
4. Ausiello G., Demange M., Laura L., and Paschos V. Algorithms for the on-line quota traveling salesman problem. Information Processing Letters 92 2 (2004) 89-94
5. G. Ausiello, V. Bonifaci, L. Laura, The online prize-collecting traveling salesman problem, Technical Report TR 08-06, Department of Computer and Systems Science, University of Rome "La Sapienza", Rome, Italy, 2006
6. Awerbuch B., Azar Y., Blum A., and Vempala S. New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM Journal on Computing 28 1 (1998) 254-262
7. Balas E. The prize collecting traveling salesman problem. Networks 19 (1989) 621-636
8. A. Blum, R. Ravi, S. Vempala, A constant-factor approximation algorithm for the k-MST problem, in: Proc. 28th Symp. on Theory of Computing, 1996, pp. 442-448
9. S.Y. Cheung, A. Kumar, Efficient quorumcast routing algorithms, in: Proc. of INFOCOM'94, vol. 2, 1994, pp. 840-847
10. Dell'Amico M., Maffioli F., and Värbrand P. On prize-collecting tours and the asymmetric travelling salesman problem. Int. Transactions in Operational Research 2 3 (1995) 297-308
11. N. Garg, Saving an epsilon: A 2-approximation for the k-MST problem in graphs, in: Proc. 37th Symp. on Theory of Computing, 2005, pp. 396-402
12. Goemans M., and Williamson D.P. A general approximation technique for constrained forest problems. SIAM Journal on Computing 24 2 (1995) 296-317