Unique Covering Problems with Geometric Sets (Q3196414): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-21398-9_43
+Normal rank
@@ Property / OpenAlex ID @@
+W2271833894
@@ Property / OpenAlex ID: W2271833894 / rank @@
+Normal rank
@@ Property / cites work @@
+Combination Can Be Hard: Approximability of the Unique Coverage Problem
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds Through Colors and IDs
@@ Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Fast approximation algorithms for a nonconvex covering problem
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Covering things with things
@@ Property / cites work: Covering things with things / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4530626
@@ Property / cites work: Q4530626 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of locating linear facilities in the plane
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of unique coverage and its variants
+Normal rank
@@ Property / cites work @@
+PTAS for geometric hitting set problems via local search
+Normal rank
@@ Property / cites work @@
+On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
+Normal rank