Approximating the multiple-depot multiple-terminal Hamiltonian path problem (Q2010925)
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: Approximating the multiple-depot multiple-terminal Hamiltonian path problem |
scientific article; zbMATH DE number 7138068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the multiple-depot multiple-terminal Hamiltonian path problem |
scientific article; zbMATH DE number 7138068 |
Statements
Approximating the multiple-depot multiple-terminal Hamiltonian path problem (English)
0 references
28 November 2019
0 references
Hamiltonian path problem
0 references
approximation algorithm
0 references
constrained forest
0 references
matroid
0 references
0 references
0 references
0.9296419024467468
0 references
0.9221149682998656
0 references
0.8549808263778687
0 references
0.842365562915802
0 references
0.8382933139801025
0 references
