Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2015.03.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2015.03.007 / rank | |||
Normal rank | |||
Latest revision as of 19:31, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph |
scientific article |
Statements
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (English)
0 references
30 September 2015
0 references
asymmetric \(m\)-peripatetic salesman problem
0 references
polynomial algorithm
0 references
performance guarantees
0 references
disjoint Hamiltonian circuits
0 references
random inputs
0 references
asymptotic optimality
0 references
0 references
0 references
0 references
