Approximation hardness of deadline-TSP reoptimization (Q1019743)
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 hardness of deadline-TSP reoptimization |
scientific article; zbMATH DE number 5559005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation hardness of deadline-TSP reoptimization |
scientific article; zbMATH DE number 5559005 |
Statements
Approximation hardness of deadline-TSP reoptimization (English)
0 references
28 May 2009
0 references
approximation algorithms
0 references
TSP with deadlines
0 references
reoptimization
0 references
inapproximability
0 references
0.9131519198417664
0 references
0.9122364521026612
0 references
0.8681982755661011
0 references
0.8169279098510742
0 references
