Pages that link to "Item:Q868952"

The following pages link to On the relationship between ATSP and the cycle cover problem (Q868952):

Displaying 10 items.

• Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
• An improved approximation algorithm for the maximum TSP (Q974748) (← links)
• Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
• Minimum-weight cycle covers and their approximability (Q1028118) (← links)
• Greedy cycles in the star graphs (Q1669899) (← links)
• Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions (Q1933544) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
• Deterministic Algorithms for Multi-criteria TSP (Q3010407) (← links)
• Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality (Q3183477) (← links)