Labeled traveling salesman problems: complexity and approximation (Q1952507)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Labeled traveling salesman problems: complexity and approximation |
scientific article |
Statements
Labeled traveling salesman problems: complexity and approximation (English)
0 references
31 May 2013
0 references
approximation algorithms
0 references
complexity
0 references
traveling salesman problem
0 references
Hamilton tour
0 references
edge-colored graphs
0 references
0 references
