Pages that link to "Item:Q298977"
From MaRDI portal
The following pages link to A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977):
Displaying 7 items.
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Improved approximations for cubic bipartite and cubic TSP (Q1801011) (← links)
- Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
- A 4/3-approximation for TSP on cubic 3-edge-connected graphs (Q2417175) (← 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)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)