Pages that link to "Item:Q1849676"
From MaRDI portal
The following pages link to Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems (Q1849676):
Displaying 9 items.
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- Erratum to ``Minimum cost flows with minimum quantities'' (Q436590) (← links)
- Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances'' (Q476920) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
