Author:
Bordenave Charles,Foss Sergey,Last Günter
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Management Science and Operations Research,Computer Science Applications
Reference12 articles.
1. Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. Proc. Camb. Philos. Soc. 55, 299–327 (1959)
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)
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)
4. Coffman, E.G. Jr., Gilbert, E.N.: Polling and greedy servers on a line. Queueing Syst. 2, 115–145 (1987)
5. Foss, S., Last, G.: Stability of polling systems with exhaustive service policies and state dependent routing. Ann. Appl. Probab. 6, 116–137 (1996)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS;Probability in the Engineering and Informational Sciences;2021-04-05
2. The critical greedy server on the integers is recurrent;The Annals of Applied Probability;2019-04-01
3. The greedy walk on an inhomogeneous Poisson process;Electronic Communications in Probability;2018-01-01
4. Distribution of the smallest visited point in a greedy walk on the line;Journal of Applied Probability;2016-09
5. Greedy walk on the real line;The Annals of Probability;2015-05-01