Maximum independent and disjoint coverage (Q5918798): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-020-00536-w
+Normal rank
@@ Property / OpenAlex ID @@
+W4229824812
@@ Property / OpenAlex ID: W4229824812 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms and APX-hardness results for geometric packing and covering problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for maximum independent set of pseudo-disks
+Normal rank
@@ Property / cites work @@
+Geometric red-blue set cover for unit squares and related problems
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum independent and disjoint coverage
@@ Property / cites work: Maximum independent and disjoint coverage / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
+Normal rank
@@ Property / cites work @@
+Q3579437
@@ Property / cites work: Q3579437 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+A 4.31-approximation for the geometric unique coverage problem on unit disks
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
+Normal rank
@@ Property / cites work @@
+Hardness results and approximation schemes for discrete packing and domination problems
+Normal rank
@@ Property / cites work @@
+Minimum-weight triangulation is NP-hard
@@ Property / cites work: Minimum-weight triangulation is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank