Cost of sequential connection for points in space

DOI10.1016/0167-6377(89)90039-4zbMath0675.90084OpenAlexW2101027188MaRDI QIDQ1122502

J. Michael Steele

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90039-4

zbMATH Keywords

spanning treenearest neighbor heuristicsequential minimal insertion proceduretraveling salseman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS ⋮ Practical distribution-sensitive point location in triangulations ⋮ On the greedy walk problem ⋮ On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\) ⋮ Quantitative two-scale stabilization on the Poisson space

Cites Work

• Unnamed Item
• On the length of optimal TSP circuits in sets of bounded diameter
• Peano curves and smoothness of functions
• A problem seminar
• The shortest path and the shortest road through n points
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Steiner Minimal Trees

This page was built for publication: Cost of sequential connection for points in space