An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s40305-021-00364-7
+Normal rank
@@ Property / OpenAlex ID @@
+W3194671897
@@ Property / OpenAlex ID: W3194671897 / rank @@
+Normal rank
@@ Property / cites work @@
+Set Partitioning: A survey
@@ Property / cites work: Set Partitioning: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to approximating partial covering problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for partial covering problems
+Normal rank
@@ Property / cites work @@
+Using Homogeneous Weights for Approximating the Partial Cover Problem
+Normal rank
@@ Property / cites work @@
+On approximation of the submodular set cover problem
+Normal rank
@@ Property / cites work @@
+A linear-time approximation algorithm for the weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+Q4537735
@@ Property / cites work: Q4537735 / rank @@
+Normal rank
@@ Property / cites work @@
+A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem
+Normal rank
@@ Property / cites work @@
+Partial multicuts in trees
@@ Property / cites work: Partial multicuts in trees / rank @@
+Normal rank