A geometric problem involving the nearest neighbour algorithm (Q1094335): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(87)90045-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081735182 / rank | |||
Normal rank | |||
Revision as of 19:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A geometric problem involving the nearest neighbour algorithm |
scientific article |
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
