Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870)
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: Optimal deterministic algorithms for some variants of online quota traveling salesman problem |
scientific article; zbMATH DE number 6597568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal deterministic algorithms for some variants of online quota traveling salesman problem |
scientific article; zbMATH DE number 6597568 |
Statements
Optimal deterministic algorithms for some variants of online quota traveling salesman problem (English)
0 references
23 June 2016
0 references
traveling salesman
0 references
quota TSP
0 references
online algorithm
0 references
competitive ratio
0 references
0.8968057036399841
0 references
0.8965060114860535
0 references
0.8207961916923523
0 references
0.8207961320877075
0 references
0.805791437625885
0 references
