Pages that link to "Item:Q6081704"
From MaRDI portal
The following pages link to FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704):
Displaying 5 items.
- A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem (Q5264766) (← links)
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem (Q5688010) (← 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)
- Improved first player strategy for the zero-sum sequential uncrossing game (Q6643644) (← links)