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
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem |
scientific article |
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
