Pages that link to "Item:Q5863328"
From MaRDI portal
The following pages link to An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem (Q5863328):
Displayed 5 items.
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6168929) (← links)
- 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)