Approximation algorithm for vertex cover with multiple covering constraints
From MaRDI portal
Recommendations
- Approximation algorithm for vertex cover with multiple covering constraints
- Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
- A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
- Tight approximation for partial vertex cover with hard capacities
- Approximation algorithms for the partition vertex cover problem
Cites work
- scientific article; zbMATH DE number 1182766 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- An analysis of the greedy algorithm for the submodular set covering problem
- Approximation algorithms for partial covering problems
- Approximation algorithms for the partition vertex cover problem
- Covering Problems with Hard Capacities
- On approximation of the submodular set cover problem
- Using homogeneous weights for approximating the partial cover problem
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
Cited in
(5)
This page was built for publication: Approximation algorithm for vertex cover with multiple covering constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2072095)
