Approximating minimum independent dominating sets in wireless networks (Q975555): Difference between revisions

@@ Property / OpenAlex ID @@
+W2053372822
@@ Property / OpenAlex ID: W2053372822 / rank @@
+Normal rank
@@ Property / cites work @@
+Unit disk graph recognition is NP-hard
@@ Property / cites work: Unit disk graph recognition is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time approximation schemes for packing and piercing fat objects
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
+Normal rank
@@ Property / cites work @@
+Approximating the minimum maximal independence number
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Geometric ad-hoc routing
@@ Property / cites work: Geometric ad-hoc routing / rank @@
+Normal rank
@@ Property / cites work @@
+Simple heuristics for unit disk graphs
@@ Property / cites work: Simple heuristics for unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / 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 @@
+Robust algorithms for restricted domains
@@ Property / cites work: Robust algorithms for restricted domains / rank @@
+Normal rank