Approximation algorithm for k-node connected subgraphs via critical graphs
From MaRDI portal
Publication:3580964
DOI10.1145/1007352.1007381zbMath1192.90233OpenAlexW2023660553MaRDI QIDQ3580964
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007381
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
Power optimization for connectivity problems ⋮ On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs ⋮ A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms
This page was built for publication: Approximation algorithm for k-node connected subgraphs via critical graphs
