DeepAI AI Chat
Log In Sign Up

Approximation Ineffectiveness of a Tour-Untangling Heuristic

by   Bodo Manthey, et al.

We analyze a tour-uncrossing heuristic for the Travelling Salesperson Problem, showing that its worst-case approximation ratio is Ω(n) and its average-case approximation ratio is Ω(√(n)) in expectation. We furthermore evaluate the approximation performance of this heuristic numerically on average-case instances, and find that it performs far better than the average-case lower bound suggests. This indicates a shortcoming in the approach we use for our analysis, which is a rather common approach in the analysis of local search heuristics.


page 1

page 2

page 3

page 4


Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise

The 2-opt heuristic is a very simple local search heuristic for the trav...

The Approximation Ratio of the 2-Opt Heuristic for the Metric Traveling Salesman Problem

The 2-Opt heuristic is one of the simplest algorithms for finding good s...

Average-case Approximation Ratio of Scheduling without Payments

Apart from the principles and methodologies inherited from Economics and...

The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem

The k-Opt heuristic is a simple improvement heuristic for the Traveling ...

Matroidal Approximations of Independence Systems

Milgrom (2017) has proposed a heuristic for determining a maximum weight...

Finding Average Regret Ratio Minimizing Set in Database

Selecting a certain number of data points (or records) from a database w...

Probabilistic Analysis of Facility Location on Random Shortest Path Metrics

The facility location problem is an NP-hard optimization problem. Theref...