Pages that link to "Item:Q2250536"

The following pages link to A new upper bound for the traveling salesman problem in cubic graphs (Q2250536):

Displaying 12 items.

• An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
• An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
• The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem (Q2090221) (← links)
• Finding 2-factors closer to TSP tours in cubic graphs (Q2848544) (← links)
• Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← links)
• Special Frequency Quadrilaterals and an Application (Q3305469) (← links)
• An Improved Exact Algorithm for Cubic Graph TSP (Q3608837) (← links)
• (Q5089192) (← links)
• The Traveling Salesman Problem for Cubic Graphs (Q5301405) (← links)
• Algorithms and Data Structures (Q5900763) (← links)
• The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals (Q6535280) (← links)
• Approximate and randomized algorithms for computing a second Hamiltonian cycle (Q6614106) (← links)