Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6057750
@@ Property / zbMATH DE Number: 6057750 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(k\)-fold dominating set
@@ Property / zbMATH Keywords: \(k\)-fold dominating set / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+slab decomposition
@@ Property / zbMATH Keywords: slab decomposition / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithm
@@ Property / zbMATH Keywords: algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+unit ball graph
@@ Property / zbMATH Keywords: unit ball graph / rank @@
+Normal rank
@@ 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/s10878-010-9372-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2036620201
@@ Property / OpenAlex ID: W2036620201 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5692521
@@ Property / cites work: Q5692521 / 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 @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Constant-time distributed dominating set approximation
+Normal rank
@@ Property / cites work @@
+Improving construction for connected dominating set with Steiner tree in wireless sensor networks
+Normal rank
@@ Property / cites work @@
+A greedy approximation for minimum connected dominating sets
+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 @@
+A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:437058