Pages that link to "Item:Q5002675"

The following pages link to New Approximation Algorithms for (1,2)-TSP (Q5002675):

Displaying 3 items.

• Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
• On the approximation ratio of the 3-opt algorithm for the \((1,2)\)-TSP (Q2060589) (← links)
• Geometric Network Creation Games (Q6141862) (← links)