New dominating sets in social networks (Q604953): Difference between revisions

@@ Property / cites work @@
+Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Q3579442
@@ Property / cites work: Q3579442 / rank @@
+Normal rank
@@ Property / cites work @@
+A special case for subset interconnection designs
@@ Property / cites work: A special case for subset interconnection designs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942157
@@ Property / cites work: Q4942157 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
+Normal rank
@@ Property / cites work @@
+MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
+Normal rank
@@ Property / cites work @@
+A greedy approximation for minimum connected dominating sets
+Normal rank
@@ Property / cites work @@
+ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
+Normal rank
@@ Property / cites work @@
+A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
+Normal rank
@@ Property / cites work @@
+A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank