The following pages link to (Q4828917):
Displaying 12 items.
- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
- (Q3024759) (← links)
- Strongly Connected Spanning Subgraph for Almost Symmetric Networks (Q3132920) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- Approximation bounds for Black Hole Search problems (Q3548722) (← links)
- A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (Q5084096) (← links)
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph (Q5346544) (← links)