A greedy approximation for minimum connected dominating sets (Q706637): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2004.08.013
@@ Property / DOI: 10.1016/j.tcs.2004.08.013 / rank @@
-Normal rank
@@ Property / author @@
+Hongwei David Du
@@ Property / author: Hongwei David Du / rank @@
+Normal rank
@@ Property / author @@
+Xiao-Hua Jia
@@ Property / author: Xiao-Hua Jia / rank @@
+Normal rank
@@ Property / author @@
+Ker-I. Ko
@@ Property / author: Ker-I. Ko / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2004.08.013
+Normal rank
@@ Property / OpenAlex ID @@
+W1987990114
@@ Property / OpenAlex ID: W1987990114 / rank @@
+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 @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2004.08.013
@@ Property / DOI: 10.1016/J.TCS.2004.08.013 / rank @@
+Normal rank