Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7661459
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem |
scientific article; zbMATH DE number 7661459 |
Statements
Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (English)
0 references
9 March 2023
0 references
asymmetric traveling salesman problem
0 references
constant-factor approximation algorithm
0 references
polynomial-time reduction
0 references
Steiner cycle problem
0 references
generalized traveling salesman problem
0 references
prize collecting traveling salesman problem
0 references
vehicle routing problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8361651301383972
0 references
0.8208299279212952
0 references
0.7712719440460205
0 references
0.7709261178970337
0 references
0.7629887461662292
0 references
