Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:39, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for the Geometric Covering Salesman Problem |
scientific article |
Statements
Approximation algorithms for the Geometric Covering Salesman Problem (English)
0 references
1 February 1995
0 references
covering salesman
0 references
tour of minimum length
0 references
