The multiple traveling salesman problem on spiders (Q831830)
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 multiple traveling salesman problem on spiders |
scientific article; zbMATH DE number 7497738
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The multiple traveling salesman problem on spiders |
scientific article; zbMATH DE number 7497738 |
Statements
The multiple traveling salesman problem on spiders (English)
0 references
24 March 2022
0 references
multiple traveling salesman problem
0 references
salesperson routing problem
0 references
approximation algorithms
0 references
polynomial-time approximation schemes
0 references
0 references
0 references
0 references
0 references
0 references
0.7708513736724854
0 references
0.7593056559562683
0 references
0.7580122947692871
0 references
0.7570112347602844
0 references
0.7449824213981628
0 references
