Skip to main content
SpringerLink
Log in

On the greedy walk problem

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This note introduces a greedy walk on Poisson and Binomial processes, which is a close relative to the well-known greedy server model. Some open problems are presented.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. Proc. Camb. Philos. Soc. 55, 299–327 (1959)

    Article  Google Scholar 

  2. Bentley, J.L., Saxe, J.B.: An analysis of two heuristics for the Euclidean traveling salesman problem. In: Proc. 18th Allerton Conference on Communication, Control and Computing, vol. 6, pp. 41–49. University of Illinois, Urbana-Champaign (1980)

    Google Scholar 

  3. Bertsimas, D.J., Garrett van Ryzin, G.: A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. 39, 601–615 (1991)

    Article  Google Scholar 

  4. Coffman, E.G. Jr., Gilbert, E.N.: Polling and greedy servers on a line. Queueing Syst. 2, 115–145 (1987)

    Article  Google Scholar 

  5. Foss, S., Last, G.: Stability of polling systems with exhaustive service policies and state dependent routing. Ann. Appl. Probab. 6, 116–137 (1996)

    Article  Google Scholar 

  6. Foss, S., Last, G.: On the stability of greedy polling systems with general service policies. Probab. Eng. Inf. Sci. 12, 49–68 (1998)

    Article  Google Scholar 

  7. Rojas-Nandayapa, L., Foss, S., Kroese, D.: Stability and performance of greedy server systems: A review and open problems. Queueing Syst., this volume (2011)

  8. Rosenkrantz, D., Stearns, R., Lewis, P.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(5), 563–581 (1977)

    Article  Google Scholar 

  9. Schassberger, R.: Stability of polling networks with state-depending server routing. Probab. Eng. Inf. Sci. 9, 539–550 (1995)

    Article  Google Scholar 

  10. Steele, J.M.: Cost of sequential connection for points in space. Oper. Res. Lett. 8(3), 137–142 (1989)

    Article  Google Scholar 

  11. Steele, J.M.: Probability Theory and Combinatorial Optimization. CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 69. SIAM, Philadelphia (1997)

    Google Scholar 

  12. Yukich, J.: Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Mathematics, vol. 1675. Springer, Berlin (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de Mathématiques de Toulouse, CNRS & Université de Toulouse, 31062, Toulouse, France

    Charles Bordenave

  2. School of Mathematics and Computer Sciences, Heriot-Watt University, Edinburgh, EH14 4AS, Scotland, UK

    Sergey Foss

  3. Institute of Mathematics, Novosibirsk, Russia

    Sergey Foss

  4. Institut für Stochastik, Karlsruhe Institute of Technology, 76128, Karlsruhe, Germany

    Günter Last

Authors
  1. Charles Bordenave
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergey Foss
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Günter Last
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Charles Bordenave.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bordenave, C., Foss, S. & Last, G. On the greedy walk problem. Queueing Syst 68, 333–338 (2011). https://doi.org/10.1007/s11134-011-9246-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-011-9246-x

Keywords

Mathematics Subject Classification (2000)

Search

Navigation