Latency Constrained Aggregation in Chain Networks Admits a PTAS

DOI10.1007/978-3-642-02158-9_24zbMath1246.90033OpenAlexW1541492479MaRDI QIDQ3638456

Alexander Souza, Tim Nonner

Publication date: 2 July 2009

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_24

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation algorithms for hitting objects with straight lines
• Algorithmic graph theory and perfect graphs
• Tight bounds for delay-sensitive aggregation
• 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
• Approximation schemes for covering and packing problems in image processing and VLSI
• Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
• Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
• Latency Constrained Aggregation in Sensor Networks

This page was built for publication: Latency Constrained Aggregation in Chain Networks Admits a PTAS