Traveling salesman problems in temporal graphs (Q284573)
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: Traveling salesman problems in temporal graphs |
scientific article; zbMATH DE number 6581632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Traveling salesman problems in temporal graphs |
scientific article; zbMATH DE number 6581632 |
Statements
Traveling salesman problems in temporal graphs (English)
0 references
18 May 2016
0 references
dynamic network
0 references
exploration
0 references
TSP with costs one and two
0 references
temporal matching
0 references
approximation algorithm
0 references
hardness result
0 references
0 references
0 references
0 references
0 references
0 references
0.9965731501579284
0 references
0.8089043498039246
0 references
0.7901087999343872
0 references
0.784587562084198
0 references
0.7788730263710022
0 references
