Pages that link to "Item:Q1386771"

The following pages link to On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (Q1386771):

Displaying 9 items.

• A lower bound for approximating the geometric minimum weight matching (Q294775) (← links)
• On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
• Not all insertion methods yield constant approximate tours in the Euclidean plane (Q1318697) (← links)
• On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems (Q3158519) (← links)
• Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
• Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. (Abstract) (Q4395317) (← links)
• Improving TSP Tours Using Dynamic Programming over Tree Decompositions (Q4973050) (← links)
• (Q5075270) (← links)