Pages that link to "Item:Q2689288"
From MaRDI portal
The following pages link to Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288):
Displaying 3 items.
- Approximation algorithms with constant factors for a series of asymmetric routing problems (Q6194441) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)
- Improved first player strategy for the zero-sum sequential uncrossing game (Q6643644) (← links)
