The minimum reload \(s-t\) path, trail and walk problems (Q987690)
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: The minimum reload s-t path, trail and walk problems |
scientific article; zbMATH DE number 5770514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum reload \(s-t\) path, trail and walk problems |
scientific article; zbMATH DE number 5770514 |
Statements
The minimum reload \(s-t\) path, trail and walk problems (English)
0 references
13 August 2010
0 references
edge-colored graphs
0 references
NP-hardness
0 references
reload optimization
0 references
paths, trails and walks
0 references
TSP
0 references
inapproximability
0 references
0.9920039
0 references
0.8982848
0 references
0 references
0.8535949
0 references
0.84117603
0 references
0 references
0 references
