Skip to main content
SpringerLink
Log in

Approximation Algorithms for Time-Dependent Orienteering

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2138))

Included in the following conference series:

Abstract

The time-dependent orienteering problem is dual to the time-dependent traveling salesman problem. It consists in visiting a maximum number of sites within a given deadline. The traveling time between two sites is in general dependent on the starting time.

We provide a (2 + ε)-approximation algorithm for the time-dependent orienteering problem which runs in polynomial time if the ratio between the maximum and minimum traveling time between any two sites is constant. No prior upper approximation bounds were known for this time-dependent problem.

The work of the first author was done while he was at the Centro de Modelamiento Matemático, Universidad de Chile and UMR 2071-CNRS, supported by FONDAP and while he was a visiting postdoc at DIMATIA-ITI partially supported by GACR 201/99/0242 and by the Ministry of Education of the Czech Republic as project LN00A056. Also this work was supported by the RFBR grant N01-01-00235.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. M. Arkin, J. S. B. Mitchell, AND G. Narasimhan, Resource-constrained geometric network optimization, in Proceedings Fourteenth ACM Symposium on Computational Geometry, June 6–10, 1998, pp. 307–316.

    Google Scholar 

  2. B. Awerbuch, Y. Azar, A. Blum, AND S. Vempala, Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesman, in Proceedings 27th Annual ACM Sympos. Theory Comput. (STOC 95), pp. 277–283, 1995.

    Google Scholar 

  3. E. Balas, The prize collecting traveling salesperson problem, Networks, 19, pp. 621–636, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  4. H.J. Bockenhauer, J. Hromkovic, R. Klasing, S. Seibert, AND W. Unger, An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality, in Proceedings 17th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Springer Verlag, pp. 111–112, 2000.

    Google Scholar 

  5. B. Broden, Time Dependent Traveling Salesman Problem, M.Sc. thesis, Department of Computer Science, Lund University, Sweden, 2000.

    Google Scholar 

  6. J. Cheriyan and R. Ravi, Approximation algorithms for network problems, manuscript, 1998. (http://www.gsia.cmu.edu/andrew/ravi/home.html)

  7. A. Czumaj, I. Finch, L. Gasieniec, A. Gibbons, P. Leng, W. Rytter, AND M. Zito, Efficient Web Searching Using Temporal Factors, in Proceedings of the 6th Workshop on Algorithms and Data Structures (WADS), F. Dehne, A. Gupta, J.-R. Sack, and R. Tamassia, eds., Springer Verlag, Lecture Notes in Computer Science, vol. 1663, 1999, pp. 294–305.

    Chapter  Google Scholar 

  8. L. Engebretsen, An explicit lower bound for TSP with distances one and two, in Proceedings 16th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Springer Verlag, pp. 373–382, 1999.

    Google Scholar 

  9. B. G. Golden, L. Levy, AND R. Vohra, The orienteering problem, Naval Res. Logistics, 34 (1991), pp. 307–318.

    Article  Google Scholar 

  10. M. Hammar AND B. Nilsson, Approximation results for kinetic variants of TSP, in Proceedings of the 26th International Colloquium on Automata, Languages, and Programming (ICALP’99), Springer Verlag, Lecture Notes in Computer Science, vol. 1644, 1999, pp. 392–401.

    Chapter  Google Scholar 

  11. D. S. Johnson, M. Minkoff, AND S. Phillips, The Prize Collecting Steiner Tree Problem: Theory and Practice, Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, (2000), pp. 760–769.

    Google Scholar 

  12. M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, H. B. Hunt III, Bicriteria network design problems, J. Algorithms 28 (1998), pp. 142–171.

    Article  MATH  MathSciNet  Google Scholar 

  13. C.H. Papadimitriou AND S. Vempala, On the approximability of the traveling salesman problem, in Proceedings of the the thirty second ACM STOC, pp. 126–133, 2000.

    Google Scholar 

  14. C.H. Papadimitriou AND M. Yannakakis, The traveling salesman problem with distances one and two, in Mathematics of Operations Research 18(1), pp. 1–11, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  15. F. C. R. Spieksma, On the approximability of an interval scheduling problem, Journal of Scheduling 2 (1999), pp. 215–227.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Mechanics, St. Petersburg State University, Bibliotechnaya sq. 2, St. Petersburg, 198904, Russia

    Fedor V. Fomin

  2. Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden

    Andrzej Lingas

Authors
  1. Fedor V. Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Latvia, Raiņa bulvaris 29, LV-1459, Riga, Latvia

    Rūsiņš Freivalds

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fomin, F.V., Lingas, A. (2001). Approximation Algorithms for Time-Dependent Orienteering. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation