A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
From MaRDI portal
Publication:2843285
DOI10.1007/978-3-642-31594-7_51zbMath1272.68461arXiv1205.1262OpenAlexW2129322254MaRDI QIDQ2843285
Shayan Oveis Gharan, Mohit Singh, Bundit Laekhanukit
Publication date: 12 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.1262
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (4)
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs ⋮ An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph ⋮ Sparse certificates for 2-connectivity in directed graphs ⋮ Dual-based approximation algorithms for cut-based network connectivity problems
This page was built for publication: A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
