Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2016.12.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2561474155
@@ Property / OpenAlex ID: W2561474155 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Distributed Approximations in Planar Graphs
@@ Property / cites work: Fast Distributed Approximations in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691778
@@ Property / cites work: Q3691778 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for local approximation
@@ Property / cites work: Lower bounds for local approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4734763
@@ Property / cites work: Q4734763 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient distributed algorithm for constructing small dominating sets
+Normal rank
@@ Property / cites work @@
+Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of the \(k\)-domination problem in graphs
+Normal rank
@@ Property / cites work @@
+Distributed minimum dominating set approximations in restricted families of graphs
+Normal rank
@@ Property / cites work @@
+The Algorithmic Complexity of k-Domatic Partition of Graphs
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+Survey of local algorithms
@@ Property / cites work: Survey of local algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
+Normal rank