Approximation algorithms for minimum-cost k-vertex connected subgraphs

DOI10.1145/509907.509955zbMATH Open1192.68883OpenAlexW1996967579MaRDI QIDQ3579233FDOQ3579233

Authors: Adrian Vetta, Joseph Cheriyan, Santosh S. Vempala 

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509955

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cited In (5)

• Algorithms for \(k\)-fault tolerant power assignments in wireless sensor networks
• Minimum power assignment in wireless ad hoc networks with spanner property
• Power assignment for \(k\)-connectivity in wireless ad hoc networks
• 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 algorithms for minimum-cost k-vertex connected subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579233)