Pages that link to "Item:Q2467566"

The following pages link to Improved approximation algorithms for metric MaxTSP (Q2467566):

Displaying 18 items.

• On the maximum TSP with \(\gamma\)-parameterized triangle inequality (Q691373) (← links)
• On the maximum betweenness improvement problem (Q737099) (← links)
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
• Minimum-weight cycle covers and their approximability (Q1028118) (← links)
• Deterministic 7/8-approximation for the metric maximum TSP (Q1034619) (← links)
• Improved deterministic approximation algorithms for max TSP (Q1041779) (← links)
• A \(\frac78\)-approximation algorithm for metric Max TSP (Q1847381) (← links)
• On random perfect matchings in metric spaces with not-too-large diameters (Q2158300) (← links)
• Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
• Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP (Q2434738) (← links)
• Improved approximation algorithms for the Min-Max selecting items problem (Q2445242) (← links)
• Approximability of the multiple stack TSP (Q2861493) (← links)
• Deterministic 7/8-Approximation for the Metric Maximum TSP (Q3541791) (← links)
• Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights (Q3618576) (← links)
• Maximum Scatter TSP in Doubling Metrics (Q4575744) (← links)
• An improved approximation algorithm for ATSP (Q5144891) (← links)
• A (slightly) improved approximation algorithm for metric TSP (Q6065169) (← links)
• Improved approximation algorithms for cycle and path packings (Q6575393) (← links)