Pages that link to "Item:Q833572"
From MaRDI portal
The following pages link to Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572):
Displaying 7 items.
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
- Approximation algorithms for maximum latency and partial cycle cover (Q1015324) (← links)
- Improved approximation algorithms for metric MaxTSP (Q2467566) (← links)
- Approximability of the multiple stack TSP (Q2861493) (← links)
- An improved approximation algorithm for ATSP (Q5144891) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313047) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)