The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.4230/lipics.ipec.2020.23 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.IPEC.2020.23 / rank | |||
Normal rank | |||
Latest revision as of 18:20, 30 December 2024
scientific article; zbMATH DE number 7764114
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Asymmetric Travelling Salesman Problem In Sparse Digraphs. |
scientific article; zbMATH DE number 7764114 |
Statements
13 November 2023
0 references
asymmetric traveling salesman problem
0 references
Hamiltonian cycle
0 references
sparse graphs
0 references
exponential algorithm
0 references
The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (English)
0 references
0 references
0 references
0 references
