On the long edges in the shortest tour through n random points

DOI10.1007/BF01285821MaRDI QIDQ1200280zbMATH OpenFDO

Authors Michel Talagrand, Wansoo T. Rhee

Publication date 17 January 1993

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01285821

zbMATH Keywords

shortest tour through \(n\) pointstraveling salesperson problem

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05)

Recommendations

• How Long Can a Euclidean Traveling Salesman Tour Be?
• On the Travelling Salesperson Problem in Many Dimensions
• Asymptotics for the Euclidean TSP with power weighted edges
• The longest edge of the random minimal spanning tree
• On the Fluctuations of the Stochastic Traveling Salesperson Problem

Cites work

• A sharp deviation inequality for the stochastic traveling salesman problem
• Complete Convergence of Short Paths and Karp's Algorithm for the TSP
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)

Cited in

(8)

• Boundary effects in the traveling salesperson problem
• Asymptotics for the Euclidean TSP with power weighted edges
• Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions
• Last-mile shared delivery: a discrete sequential packing approach
• How Long Can a Euclidean Traveling Salesman Tour Be?
• Traveling in randomly embedded random graphs
• Traveling in randomly embedded random graphs
• Percolating paths through random points

This page was built for publication: On the long edges in the shortest tour through \(n\) random points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200280)