The Budgeted Unique Coverage Problem and Color-Coding (Q3392967): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03351-3_29
+Normal rank
@@ Property / OpenAlex ID @@
+W1599787684
@@ Property / OpenAlex ID: W1599787684 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized hashing and parent-identifying codes.
@@ Property / cites work: Generalized hashing and parent-identifying codes. / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
+Normal rank
@@ Property / cites work @@
+Q2934608
@@ Property / cites work: Q2934608 / rank @@
+Normal rank
@@ Property / cites work @@
+Combination can be hard
@@ Property / cites work: Combination can be hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579437
@@ Property / cites work: Q3579437 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of unique coverage and its variants
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of the Unique Coverage Problem
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions
+Normal rank