Pages that link to "Item:Q4973051"

The following pages link to A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem (Q4973051):

Displaying 14 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)
• Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem (Q324874) (← 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)
• A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
• A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
• A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988) (← links)
• Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph (Q2706198) (← links)
• (Q2753746) (← links)
• An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
• Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
• Color-avoiding connected spanning subgraphs with minimum number of edges (Q6130205) (← links)
• Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)