Latency Constrained Aggregation in Chain Networks Admits a PTAS
From MaRDI portal
Recommendations
Cites work
- Algorithmic graph theory and perfect graphs
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
- Approximation algorithms for hitting objects with straight lines
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation schemes for covering and packing problems in image processing and VLSI
- Clique partitioning of interval graphs with submodular costs on the cliques
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
- scientific article; zbMATH DE number 2086617 (Why is no real title available?)
- scientific article; zbMATH DE number 6469200 (Why is no real title available?)
- Latency Constrained Aggregation in Sensor Networks
- Tight bounds for delay-sensitive aggregation
Cited in
(4)
This page was built for publication: Latency Constrained Aggregation in Chain Networks Admits a PTAS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638456)