Algorithms for communication scheduling in data gathering network with data compression (Q1755733): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-017-0373-6
@@ Property / DOI: 10.1007/s00453-017-0373-6 / 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/s00453-017-0373-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2754604279
@@ Property / OpenAlex ID: W2754604279 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing system lifetime in wireless sensor networks
+Normal rank
@@ Property / cites work @@
+Communication scheduling in data gathering networks with limited memory
+Normal rank
@@ Property / cites work @@
+Scheduling for data gathering networks with data compression
+Normal rank
@@ Property / cites work @@
+Handbook on Scheduling
@@ Property / cites work: Handbook on Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved dynamic programming in connection with an FPTAS for the knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
+Normal rank
@@ Property / DOI @@
+.1007/S00453-017-0373-6
@@ Property / DOI: 10.1007/S00453-017-0373-6 / rank @@
+Normal rank