Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208): Difference between revisions

@@ Property / cites work @@
+Implicit branching and parameterized partial cover problems
+Normal rank
@@ Property / cites work @@
+Q4263699
@@ Property / cites work: Q4263699 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum vertex coverage problem on bipartite graphs
+Normal rank
@@ Property / cites work @@
+Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Using Homogeneous Weights for Approximating the Partial Cover Problem
+Normal rank
@@ Property / cites work @@
+Computing small partial coverings
@@ Property / cites work: Computing small partial coverings / rank @@
+Normal rank
@@ Property / cites work @@
+Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Q4400849
@@ Property / cites work: Q4400849 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3455036
@@ Property / cites work: Q3455036 / rank @@
+Normal rank
@@ Property / cites work @@
+A better approximation ratio for the vertex cover problem
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+On non-optimally expanding sets in Grassmann graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for partial covering problems
+Normal rank
@@ Property / cites work @@
+Improved Upper Bounds for Partial Vertex Cover
@@ Property / cites work: Improved Upper Bounds for Partial Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
+Normal rank
@@ Property / cites work @@
+Approximation of Partial Capacitated Vertex Cover
@@ Property / cites work: Approximation of Partial Capacitated Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+The Approximability of Partial Vertex Covers in Trees
+Normal rank
@@ Property / cites work @@
+Partial vs. Complete Domination: t-Dominating Set
@@ Property / cites work: Partial vs. Complete Domination: t-Dominating Set / rank @@
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+A unified approach to approximating partial covering problems
+Normal rank
@@ Property / cites work @@
+Intuitive Algorithms and t-Vertex Cover
@@ Property / cites work: Intuitive Algorithms and t-Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank