An approximation algorithm for maximum weight budgeted connected set cover (Q281790): Difference between revisions

@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems
+Normal rank
@@ Property / cites work @@
+Efficient recovery from power outage (extended abstract)
+Normal rank
@@ Property / cites work @@
+Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Minimum connected dominating sets and maximal independent sets in unit disk graphs
+Normal rank
@@ Property / cites work @@
+Algorithms for connected set cover problem and fault-tolerant connected set cover problem
+Normal rank