Approximation algorithm for k-node connected subgraphs via critical graphs
From MaRDI portal
Approximation algorithm for \(k\)-node connected subgraphs via critical graphs
Recommendations
- Approximating k-node Connected Subgraphs via Critical Graphs
- Approximating node connectivity problems via set covers
- Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs
- An \(O(\log^2{k})\)-approximation algorithm for the \(k\)-vertex connected spanning subgraph problem
- An almost O( k)-approximation for k-connected subgraphs
Cited in
(12)- A 4+ approximation for k-connected subgraphs
- Approximating minimum-cost connected \(T\)-joins
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms
- Approximation algorithms for minimum-cost k-(S,T) connected digraphs
- Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs
- A derandomized approximation algorithm for the critical node detection problem
- scientific article; zbMATH DE number 1182763 (Why is no real title available?)
- An \(O(\log^2{k})\)-approximation algorithm for the \(k\)-vertex connected spanning subgraph problem
- scientific article; zbMATH DE number 7059791 (Why is no real title available?)
- Approximating k-node Connected Subgraphs via Critical Graphs
- Power optimization for connectivity problems
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs
This page was built for publication: Approximation algorithm for \(k\)-node connected subgraphs via critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580964)
