Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338)
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: Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph |
scientific article; zbMATH DE number 6487383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph |
scientific article; zbMATH DE number 6487383 |
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
0 references
0.832712709903717
0 references
0.8324267268180847
0 references
0.8288386464118958
0 references
0.8193557858467102
0 references
0.8153817057609558
0 references
