A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
From MaRDI portal
Recommendations
- Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
- Distributed set cover approximation: primal-dual with optimal locality
- A Local 2-Approximation Algorithm for the Vertex Cover Problem
- A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
- Capacitated vertex covering
Cited in
(11)- O(f) bi-criteria approximation for capacitated covering with hard capacities
- Iterative partial rounding for vertex cover with hard capacities
- Capacitated Arc Stabbing
- Fast primal-dual distributed algorithms for scheduling and matching problems
- Tight approximation for partial vertex cover with hard capacities
- On the weighted \(k\)-path vertex cover problem
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- Tight approximation for partial vertex cover with hard capacities
- Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
- Distributed algorithms for covering, packing and maximum weighted matching
- Approximating bipartite minimum vertex cover in the Congest model
This page was built for publication: A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631893)