The following pages link to Graphic TSP in cubic graphs (Q4636625):
Displaying 14 items.
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- Simple cubic graphs with no short traveling salesman tour (Q1752607) (← links)
- Improved approximations for cubic bipartite and cubic TSP (Q1801011) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Short cycle covers of graphs with at most 77\% vertices of degree two (Q2213807) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) (← links)
- \(\frac {13}{9}\)-approximation for graphic TSP (Q2904746) (← links)
- A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs (Q2969624) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- An Improved Exact Algorithm for Cubic Graph TSP (Q3608837) (← links)
- Cubic TSP: A 1.3-Approximation (Q4581212) (← links)
- Approximating the regular graphic TSP in near linear time (Q5275362) (← links)
