Improved approximation of maximum vertex coverage problem on bipartite graphs
From MaRDI portal
Publication:2935262
Recommendations
- The maximum vertex coverage problem on bipartite graphs
- Partial vertex cover and budgeted maximum coverage in bipartite graphs
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
- On approximation of max-vertex-cover
- Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7
Cited in
(15)- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
- Simplicial complexes and closure systems induced by indistinguishability relations
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
- Partial vertex cover and budgeted maximum coverage in bipartite graphs
- On approximation of max-vertex-cover
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
- Indiscernibility structures induced from function sets: graph and digraph case
- The maximum vertex coverage problem on bipartite graphs
- A 0.821-ratio purely combinatorial algorithm for maximum \(k\)-vertex cover in bipartite graphs
- Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7
- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
- Maximum weighted independent sets with a budget
This page was built for publication: Improved approximation of maximum vertex coverage problem on bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935262)
