A geometric problem involving the nearest neighbour algorithm (Q1094335)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A geometric problem involving the nearest neighbour algorithm |
scientific article; zbMATH DE number 4025171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A geometric problem involving the nearest neighbour algorithm |
scientific article; zbMATH DE number 4025171 |
Statements
A geometric problem involving the nearest neighbour algorithm (English)
0 references
1987
0 references
It is shown that for arbitrary large n there exist sets S in the unit square of \({\mathbb{R}}^ 2\) with \(| S| \leq n\), such that starting at any chosen point \(P_ 1\in S\) and touring S according to the Nearest Neighbour Algorithm, the sum of the squares of the distances exceeds \(c\cdot \log_ 2n\), with \(c>0\).
0 references
traveling salesman problem
0 references
Nearest Neighbour Algorithm
0 references
