On the greedy walk problem

DOI10.1007/S11134-011-9246-XzbMath1275.60048OpenAlexW2163144564MaRDI QIDQ383202

Günter Last, Charles Bordenave, Sergeĭ Georgievich Foss

Publication date: 25 November 2013

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-011-9246-x

zbMATH Keywords

greedy algorithmpoint processestravelling salesperson problem

Mathematics Subject Classification ID

Processes in random environments (60K37) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (6)

THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS ⋮ Two queues with non-stochastic arrivals ⋮ Greedy clearing of persistent Poissonian dust ⋮ The critical greedy server on the integers is recurrent ⋮ The greedy walk on an inhomogeneous Poisson process ⋮ Greedy walk on the real line

Cites Work

• Unnamed Item
• Unnamed Item
• Stability and performance of greedy server systems
• Polling and greedy servers on a line
• Cost of sequential connection for points in space
• Probability theory of classical Euclidean optimization problems
• Stability of polling systems with exhaustive service policies and state-dependent routing
• Stability of Polling Networks with State-Dependent Server Routing
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• On the Stability of Greedy Polling Systems with General Service Policies

This page was built for publication: On the greedy walk problem