Unconstrained traveling tournament problem is APX-complete (Q6047703)
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: Unconstrained traveling tournament problem is APX-complete |
scientific article; zbMATH DE number 7736834
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unconstrained traveling tournament problem is APX-complete |
scientific article; zbMATH DE number 7736834 |
Statements
Unconstrained traveling tournament problem is APX-complete (English)
0 references
12 September 2023
0 references
traveling tournament problem
0 references
APX-complete
0 references
approximation algorithms
0 references
traveling salesman problem
0 references
