Pages that link to "Item:Q833572"

The following pages link to Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572):

Displaying 3 items.

• An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
• (Q2861493) (← links)
• Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)