On approximation of dominating tree in wireless sensor networks (Q1958639): 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/s11590-010-0175-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2081126596
@@ Property / OpenAlex ID: W2081126596 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Approximating the tree and tour covers of a graph
@@ Property / cites work: Approximating the tree and tour covers of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On approximability of the independent/connected edge dominating set problems
+Normal rank
@@ Property / cites work @@
+How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Directed Steiner Problems
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1958639