Pages that link to "Item:Q3186507"
From MaRDI portal
The following pages link to Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507):
Displaying 13 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)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- A 4/3-approximation for TSP on cubic 3-edge-connected graphs (Q2417175) (← links)
- An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) (← links)
- Finding 2-factors closer to TSP tours in cubic graphs (Q2848544) (← links)
- A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs (Q2969624) (← links)
- Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← links)
- An Improved Exact Algorithm for Cubic Graph TSP (Q3608837) (← links)
- Cubic TSP: A 1.3-Approximation (Q4581212) (← links)