Iterative partial rounding for vertex cover with hard capacities
From MaRDI portal
Publication:2223692
Recommendations
- Iterative partial rounding for vertex cover with hard capacities
- Tight algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
- Tight approximation for partial vertex cover with hard capacities
- Tight approximation for partial vertex cover with hard capacities
- Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A 5-approximation for capacitated facility location
- A Best Possible Heuristic for the k-Center Problem
- A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
- A linear-time approximation algorithm for the weighted vertex cover problem
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- An analysis of the greedy algorithm for the submodular set covering problem
- An improved approximation algorithm for vertex cover with hard capacities
- Approximating \(k\)-median via pseudo-approximation
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Approximation algorithms for partial covering problems
- Capacitated Domination and Covering: A Parameterized Perspective
- Capacitated domination faster than \(O(2^n)\)
- Capacitated domination problem
- Capacitated domination: problem complexity and approximation algorithms
- Capacitated vertex covering
- Centrality of trees for capacitated \(k\)-center
- Covering Problems with Hard Capacities
- Dependent rounding and its applications to approximation algorithms
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
- LP-based algorithms for capacitated facility location
- On uniform capacitated \(k\)-median beyond the natural LP relaxation
- Set cover revisited: hypergraph cover with hard capacities
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- \(O(f)\) bi-criteria approximation for capacitated covering with hard capacities
Cited in
(3)
This page was built for publication: Iterative partial rounding for vertex cover with hard capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223692)
