Pages that link to "Item:Q4507363"
From MaRDI portal
The following pages link to Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching (Q4507363):
Displaying 34 items.
- On computing the 2-vertex-connected components of directed graphs (Q266828) (← links)
- On the maximum size of a minimal \(k\)-edge connected augmentation (Q765200) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks (Q1115406) (← links)
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph (Q1186788) (← links)
- Hereditary systems and greedy-type algorithms. (Q1414589) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- More routes for evacuation (Q1790955) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- Flexible graph connectivity (Q2118137) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- Small \(\ell\)-edge-covers in \(k\)-connected graphs (Q2446854) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Box-total dual integrality and edge-connectivity (Q2689821) (← links)
- Minimum cost \(\leq k\) edges connected subgraph problems (Q2883545) (← links)
- Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
- Network flow spanners (Q3057178) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter (Q3338283) (← links)
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- Minimum 2-vertex strongly biconnected spanning directed subgraph problem (Q5051435) (← links)
- Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs (Q5222543) (← links)
- Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges (Q5351864) (← links)
- Computing the 2-blocks of directed graphs (Q5501861) (← links)
- Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- Improved approximations for relative survivable network design (Q6574948) (← links)
