Pages that link to "Item:Q397064"
From MaRDI portal
The following pages link to Approximating minimum-cost edge-covers of crossing biset-families (Q397064):
Displaying 8 items.
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- Approximation algorithms for node and element connectivity augmentation problems (Q6635706) (← links)
