Skip to main content
SpringerLink
Log in

Serving requests with on-line routing

  • Conference paper
  • First Online:
Algorithm Theory — SWAT '94 (SWAT 1994)

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

Included in the following conference series:

Abstract

In this paper we consider the on-line version of the routing problem with release times. Formally, it consists in a metric space M with a distinguished point o (the origin), plus a sequence of triples<t i,pi,ri> where p i is a point of M, r i specifies the first moment in which the request is ready to be served, and t i represents the moment in which the request is known. A server located at point o at time 0 that moves at constant unit speed must serve the sequence of requests trying to minimize the total time till all the requests are served.

An on-line server follows a solution computed on the basis of the set of requests presented in the past; this solution may be updated each time some new piece of information is known. We show that no on-line algorithm, neither deterministic nor randomized, can achieve a competitive factor lower than 2. We give a 5/2-competitive exponential algorithm and a 3-competitive polynomial algorithm for the plane, and a 7/3-competitive algorithm for the line.

This work was partly supported by ESPRIT BRA Alcom II under contract No.7141, and by Italian Ministry of Scientific Research Project 40% “Algoritmi, Modelli di Calcolo e Strutture Informative”.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Atallah and S. Kosaraju, Efficient solutions for some transportation problems with application to minimizing robot arm travel, SIAM J. on Computing, 17 (1988), pp. 849–869.

    Article  Google Scholar 

  2. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos and A. Widgerson, On the power of randomization in on-line algorithms, Proc. of the 22nd Annual ACM Symposium on Theory of Computing, (1990), pp. 379–386.

    Google Scholar 

  3. R. El-Yaniv, A. Fiat, R.M. Karp and G. Turpin, Competitive analysis of financial games, Proc. 33rd Annual Symposium on Foundations of Computer Science (1992), pp. 327–333.

    Google Scholar 

  4. G. Frederickson, A note on the complexity of a simple transportation problem, SIAM J. on Computing, 22-1 (1993), pp. 57–61.

    Google Scholar 

  5. G. Frederickson and D. Guan, Preemptive ensemble motion planning on a tree, SIAM J. on Computing, 21-6 (1992), pp. 1130–1152.

    Google Scholar 

  6. G. Frederickson, M. Hecht and C. Kim, Approximation algorithms for some routing problems, SIAM J. on Computing, 7-2 (1978), pp. 178–193.

    Google Scholar 

  7. M. Garey, and D. Johnson, Computers and intractability: a guide to the theory of NP-completeness, Freeman, San Francisco (1979).

    Google Scholar 

  8. Y. Karuno, H. Nagamochi and T. Ibaraki: Vehicle scheduling on a tree with release times and handling times, Proc. 4th. International Symposium on Algorithms and Computation ISAAC'93, LNCS 762 (1993), Springer-Verlag, pp. 486–495.

    Google Scholar 

  9. B. Kalyanasundaram and K.R. Pruhs, Constructing competitive tours from local information, Proc. 20th International Colloquium on Automata, Languages and Programming, LNCS 700 (1993), Springer-Verlag.

    Google Scholar 

  10. M. Manasse, L.A. McGeoch and D. Sleator, Competitive algorithms for server problems, Journal of Algorithms 11 (1990), pp. 208–230.

    Article  Google Scholar 

  11. H. Psaraftis, M. Solomon, T. Magnanti and T. Kim, Routing and scheduling on a shoreline with release times, Management Science 36-2 (1990), pp. 212–223.

    Google Scholar 

  12. D. Sleator, R. Tarjan, Amortized efficiency of list update and paging algorithms, Comm. ACM 28 (1985), pp. 202–208.

    Article  Google Scholar 

  13. D. Sleator, R. Tarjan, Self-adjusting binary search trees, Journal of the ACM, 32 (1985), pp. 652–686.

    Article  Google Scholar 

  14. M. Solomon, Algorithms for the vehicle routing and scheduling problem with time window constraints, Operations Research, 35-2 (1987), pp. 254–265.

    MathSciNet  Google Scholar 

  15. M. Solomon and J. Desrosiers, Time window constrained routing and scheduling problems: a survey, Transportation Science, 22 (1988), pp. 1–13.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, 00198, Roma, Italia

    Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi & Maurizio Talamo

  2. Department of Operations Research, University of Amsterdam, Roetersstraat 11, 1018, WB Amsterdam, The Netherlands

    Leen Stougie

Authors
  1. Giorgio Ausiello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Esteban Feuerstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefano Leonardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Leen Stougie
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Maurizio Talamo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Erik M. Schmidt Sven Skyum

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., Talamo, M. (1994). Serving requests with on-line routing. In: Schmidt, E.M., Skyum, S. (eds) Algorithm Theory — SWAT '94. SWAT 1994. Lecture Notes in Computer Science, vol 824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58218-5_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-58218-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58218-2

  • Online ISBN: 978-3-540-48577-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation