A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs
From MaRDI portal
Publication:2019478
DOI10.1007/978-3-030-58150-3_28OpenAlexW3082464451MaRDI QIDQ2019478
Joachim Spoerhase, Stephan Beyer, Markus Chimani
Publication date: 21 April 2021
Full work available at URL: https://arxiv.org/abs/1808.04651
Cites Work
- A factor 2 approximation algorithm for the generalized Steiner network problem
- An efficient approximation algorithm for the survivable network design problem
- Conditional disclosure of secrets via non-linear reconstruction
- Yes, there is an oblivious RAM lower bound!
- A matroid approach to finding edge connectivity and packing arborescences
- A primal-dual approximation algorithm for generalized Steiner network problems
- The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model
- Secret Sharing, Rank Inequalities and Information Inequalities
- The Design of Approximation Algorithms
- How to share a secret
- k-Edge-Connectivity: Approximation and LP Relaxation
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- Approximation Algorithms for Several Graph Augmentation Problems
- Approximation Algorithms for Graph Augmentation
- Biconnectivity approximations and graph carvings
- On secret sharing systems
- A General Approximation Technique for Constrained Forest Problems
- Breaking the circuit-size barrier in secret sharing
- Lifting Nullstellensatz to monotone span programs over any field
- Tight cell probe bounds for succinct Boolean matrix-vector multiplication
- The cell probe complexity of dynamic range counting
- Logarithmic Lower Bounds in the Cell-Probe Model
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs
