Approximation algorithms with constant ratio for general cluster routing problems (Q2084625)
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 algorithms with constant ratio for general cluster routing problems |
scientific article; zbMATH DE number 7603279
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms with constant ratio for general cluster routing problems |
scientific article; zbMATH DE number 7603279 |
Statements
Approximation algorithms with constant ratio for general cluster routing problems (English)
0 references
18 October 2022
0 references
graph routing problem
0 references
traveling salesman problem
0 references
combinatorial approximation algorithm
0 references
general cluster routing problem
0 references
0 references
0 references
0 references
