Revisiting connected dominating sets: an almost optimal local information algorithm (Q2414868): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-019-00545-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2917720955
@@ Property / OpenAlex ID: W2917720955 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Connected dominating set. Theory and applications
@@ Property / cites work: Connected dominating set. Theory and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471362
@@ Property / cites work: Q4471362 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Improved methods for approximating node weighted Steiner trees and connected dominating sets.
+Normal rank
@@ Property / cites work @@
+Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
+Normal rank