Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-017-0385-2
@@ Property / DOI: 10.1007/s00453-017-0385-2 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.09156
@@ Property / arXiv ID: 1511.09156 / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
+Normal rank
@@ Property / cites work @@
+Weighted geometric set multi-cover via quasi-uniform sampling
+Normal rank
@@ Property / cites work @@
+Steiner Tree Approximation via Iterative Randomized Rounding
+Normal rank
@@ Property / cites work @@
+Prize-Collecting Survivable Network Design in Node-Weighted Graphs
+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 @@
+Latency-bounded target set selection in social networks
+Normal rank
@@ Property / cites work @@
+On the approximability and exact algorithms for vector domination and related problems in graphs
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
+Normal rank
@@ Property / cites work @@
+Spider covers for prize-collecting network activation problem
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+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 @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+Normal rank
@@ Property / cites work @@
+Simple heuristics for unit disk graphs
@@ Property / cites work: Simple heuristics for unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum-cost connectivity problems via uncrossable bifamilies
+Normal rank
@@ Property / cites work @@
+On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
+Normal rank
@@ Property / cites work @@
+A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
+Normal rank
@@ Property / cites work @@
+Node-weighted Steiner tree approximation in unit disk graphs
+Normal rank
@@ Property / cites work @@
+New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
+Normal rank
@@ Property / DOI @@
+.1007/S00453-017-0385-2
@@ Property / DOI: 10.1007/S00453-017-0385-2 / rank @@
+Normal rank