Approximation algorithm for vertex cover with multiple covering constraints
From MaRDI portal
Publication:5091035
DOI10.4230/LIPICS.ISAAC.2018.43MaRDI QIDQ5091035FDOQ5091035
Authors: Eunpyeong Hong, Mong-Jen Kao 
Publication date: 21 July 2022
Recommendations
- Approximation algorithm for vertex cover with multiple covering constraints
- Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
- Approximation algorithms for the partition vertex cover problem
- A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
- Tight approximation for partial vertex cover with hard capacities
Cites Work
- An analysis of the greedy algorithm for the submodular set covering problem
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Using homogeneous weights for approximating the partial cover problem
- Approximation algorithms for partial covering problems
- Applications of approximation algorithms to cooperative games
- Title not available (Why is that?)
- On approximation of the submodular set cover problem
- Covering Problems with Hard Capacities
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation algorithms for the partition vertex cover problem
Cited In (7)
- Combining Two Worlds: Parameterised Approximation for Vertex Cover
- Algorithms for covering multiple submodular constraints and applications
- Matroid-constrained vertex cover
- Vertex cover meets scheduling
- Approximation algorithm for vertex cover with multiple covering constraints
- Approximation algorithm for prize-collecting vertex cover with fairness constraints
- Tight approximation for partial vertex cover with hard capacities
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 Q5091035)
