The generalized maximum coverage problem (Q963466): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2008.03.017
@@ Property / DOI: 10.1016/j.ipl.2008.03.017 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2008.03.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2065487600
@@ Property / OpenAlex ID: W2065487600 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q29011249
@@ Property / Wikidata QID: Q29011249 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263699
@@ Property / cites work: Q4263699 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient approximation for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Tight approximation algorithms for maximum general assignment problems
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / 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 @@
+Q4414508
@@ Property / cites work: Q4414508 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753744
@@ Property / cites work: Q2753744 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the generalized assignment problem
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2008.03.017
@@ Property / DOI: 10.1016/J.IPL.2008.03.017 / rank @@
+Normal rank