(6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (Q3511366): 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/978-3-540-69733-6_54
+Normal rank
@@ Property / OpenAlex ID @@
+W1530712874
@@ Property / OpenAlex ID: W1530712874 / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
+Normal rank
@@ Property / cites work @@
+Approximations for Steiner trees with minimum number of Steiner points
+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 note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3511366