Amanote Research

Amanote Research

    RegisterSign In

Approximating the Euclidean Traveling Salesman Problem (TSP)

Geometric Approximation Algorithms
doi 10.1090/surv/173/13
Full Text
Open PDF
Abstract

Available in full text

Date

June 15, 2011

Authors
Sariel Har-Peled
Publisher

American Mathematical Society


Related search

Solution for a Bipartite Euclidean Traveling-Salesman Problem in One Dimension

Physical review. E
Nonlinear PhysicsProbabilityStatisticsCondensed Matter PhysicsStatistical
2018English

The Traveling Salesman Problem

English

Traveling Salesman Problem

2011English

Traveling Salesman Problem

English

Information in the Traveling Salesman Problem

Applied Mathematics
2012English

Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman Problem

Algorithms
MathematicsComputational MathematicsNumerical AnalysisTheoretical Computer ScienceComputational Theory
2019English

Exact Algorithms for the Equitable Traveling Salesman Problem

SSRN Electronic Journal
2016English

The Traveling Salesman Goes Shopping: The Systematic Deviations of Grocery Paths From TSP-Optimality

SSRN Electronic Journal
2008English

Solving the Traveling Salesman Problem on a Quantum Annealer

SN Applied Sciences
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy