Improved approximation algorithm for the asymmetric prize-collecting TSP (Q6167003)
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: Improved approximation algorithm for the asymmetric prize-collecting TSP |
scientific article; zbMATH DE number 7708512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithm for the asymmetric prize-collecting TSP |
scientific article; zbMATH DE number 7708512 |
Statements
Improved approximation algorithm for the asymmetric prize-collecting TSP (English)
0 references
7 July 2023
0 references
asymmetric prize-collecting traveling salesman problem
0 references
approximation algorithm
0 references
0 references
0.9234226942062378
0 references
0.9208497405052184
0 references
0.8676824569702148
0 references
0.8567597270011902
0 references
0.8536805510520935
0 references
