How Long Can a Euclidean Traveling Salesman Tour Be?
From MaRDI portal
Publication:4731207
DOI10.1137/0402010zbMath0682.05041OpenAlexW2058312407MaRDI QIDQ4731207
Publication date: 1989
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0402010
Graph theory (including graph drawing) in computer science (68R10) Inventory, storage, reservoirs (90B05) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Euclidean geometries (general) and generalizations (51M05)
Related Items (21)
Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points ⋮ Approximation schemes for node-weighted geometric Steiner tree problems ⋮ Quantizers ad the worst case Euclidean traveling salesman problem ⋮ On the Lengths of Curves Passing Through Boundary Points of a Planar Convex Shape ⋮ A PTAS for the geometric connected facility location problem ⋮ Household-Level Economies of Scale in Transportation ⋮ Watchman tours for polygons with holes ⋮ Minimum rectilinear Steiner tree of \(n\) points in the unit square ⋮ The Shortest Separating Cycle Problem ⋮ On estimating the distribution of optimal traveling salesman tour lengths using heuristics ⋮ A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing ⋮ Steiner minimal trees in rectilinear and octilinear planes ⋮ Worst-case minimum rectilinear Steiner trees in all dimensions ⋮ Worst-case demand distributions in vehicle routing ⋮ Gossip algorithms for heterogeneous multi-vehicle routing problems ⋮ Asymptotic component densities in programmable gate arrays realizing all circuits of a given size ⋮ Bounds for the traveling salesman paths of two-dimensional modular lattices ⋮ Unnamed Item ⋮ Last-Mile Shared Delivery: A Discrete Sequential Packing Approach ⋮ On the shortest separating cycle ⋮ On the Stretch Factor of Polygonal Chains
This page was built for publication: How Long Can a Euclidean Traveling Salesman Tour Be?
