Pages that link to "Item:Q5254089"

The following pages link to TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089):

Displaying 15 items.

• A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
• A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
• Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
• Simple cubic graphs with no short traveling salesman tour (Q1752607) (← links)
• Improved approximations for cubic bipartite and cubic TSP (Q1801011) (← links)
• The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem (Q2090221) (← links)
• Approximating TSP walks in subcubic graphs (Q2101165) (← links)
• Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
• Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
• Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← links)
• Special Frequency Quadrilaterals and an Application (Q3305469) (← links)
• Cubic TSP: A 1.3-Approximation (Q4581212) (← links)
• On Dominating Even Subgraphs in Cubic Graphs (Q5346564) (← links)
• Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals (Q6138827) (← links)
• The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals (Q6535280) (← links)