Approximation algorithms for the \(k\)-depots Hamiltonian path problem (Q2128771)
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: Approximation algorithms for the k-depots Hamiltonian path problem |
scientific article; zbMATH DE number 7511909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the \(k\)-depots Hamiltonian path problem |
scientific article; zbMATH DE number 7511909 |
Statements
Approximation algorithms for the \(k\)-depots Hamiltonian path problem (English)
0 references
22 April 2022
0 references
Hamiltonian path problem
0 references
approximation algorithm
0 references
multiple salesmen
0 references
multiple depots
0 references
Christofides-like heuristic
0 references
0 references
0 references
0 references
0.9221149682998656
0 references
0.8892590999603271
0 references
0.8760883212089539
0 references
0.8706589937210083
0 references
