Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179): Difference between revisions

@@ Property / cites work @@
+Max-leaves spanning tree is APX-hard for cubic graphs
+Normal rank
@@ Property / cites work @@
+Grid coverage for surveillance and target location in distributed sensor networks
+Normal rank
@@ Property / cites work @@
+Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum leaf spanning tree problem.
+Normal rank
@@ Property / cites work @@
+The maximum-leaf spanning tree problem: Formulations and facets
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
+Normal rank
@@ Property / cites work @@
+The Domination Number of Grids
@@ Property / cites work: The Domination Number of Grids / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Reformulations and solution algorithms for the maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks
+Normal rank
@@ Property / cites work @@
+Complexity of the maximum leaf spanning tree problem on planar and regular graphs
+Normal rank
@@ Property / cites work @@
+Flow-based formulation for the maximum leaf spanning tree problem
+Normal rank