Pages that link to "Item:Q2706198"
From MaRDI portal
The following pages link to Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph (Q2706198):
Displaying 15 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)
- 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)
- Finding 2-edge connected spanning subgraphs. (Q1426722) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988) (← links)
- (Q3840352) (← links)
- A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem (Q4973051) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
- How to Secure Matchings against Edge Failures (Q5157391) (← links)
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph (Q5346544) (← links)
- Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges (Q5351864) (← links)
- Approximation and Online Algorithms (Q5713436) (← links)
- Beating the Integrality Ratio for $s$-$t$-Tours in Graphs (Q6139824) (← links)
