Approximating minimum-cost edge-covers of crossing biset-families
From MaRDI portal
Publication:397064
DOI10.1007/s00493-014-2773-4zbMath1313.05208arXiv1207.4366OpenAlexW2033691165MaRDI QIDQ397064
Publication date: 14 August 2014
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.4366
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (7)
Improved approximation algorithms for minimum cost node-connectivity augmentation problems ⋮ Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design ⋮ An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem ⋮ Approximating minimum power edge-multi-covers ⋮ A \(4+\epsilon\) approximation for \(k\)-connected subgraphs ⋮ Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs ⋮ Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
Cites Work
- Unnamed Item
- An approximation algorithm for minimum-cost vertex-connectivity problems
- Inapproximability of survivable networks
- Rooted \(k\)-connections in digraphs
- Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
- On the optimal vertex-connectivity augmentation
- Minimal edge-coverings of pairs of sets
- A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs
- Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs
- Approximating Subset k-Connectivity Problems
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- Approximating k-node Connected Subgraphs via Critical Graphs
This page was built for publication: Approximating minimum-cost edge-covers of crossing biset-families
