Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (Q4579900): Difference between revisions

@@ Property / DOI @@
-.1051/ro/2017085
@@ Property / DOI: 10.1051/ro/2017085 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2964191496
@@ Property / OpenAlex ID: W2964191496 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07930
@@ Property / arXiv ID: 1502.07930 / rank @@
+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 @@
+Approximating low-dimensional coverage problems
@@ Property / cites work: Approximating low-dimensional coverage problems / rank @@
+Normal rank
@@ Property / cites work @@
+On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
+Normal rank
@@ Property / cites work @@
+Q4255028
@@ Property / cites work: Q4255028 / rank @@
+Normal rank
@@ Property / cites work @@
+The hardness of approximation: Gap location
@@ Property / cites work: The hardness of approximation: Gap location / rank @@
+Normal rank
@@ Property / cites work @@
+Max cut and the smallest eigenvalue
@@ Property / cites work: Max cut and the smallest eigenvalue / rank @@
+Normal rank
@@ Property / DOI @@
+.1051/RO/2017085
@@ Property / DOI: 10.1051/RO/2017085 / rank @@
+Normal rank