Latency Constrained Aggregation in Sensor Networks
From MaRDI portal
Publication:5449519
DOI10.1007/11841036_11zbMath1131.68591OpenAlexW1480448117MaRDI QIDQ5449519
Peter Korteweg, Andrea Vitaletti, Luca Becchetti, Leen Stougie, Alberto Marchetti-Spaccamela
Publication date: 11 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/7e7324cb-e274-4808-91d3-641b8fe2fb1c
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (8)
The submodular joint replenishment problem ⋮ Capacitated max-batching with interval graph compatibilities ⋮ A weakly robust PTAS for minimum clique partition in unit disk graphs ⋮ Clique partitioning of interval graphs with submodular costs on the cliques ⋮ Clique Clustering Yields a PTAS for max-Coloring Interval Graphs ⋮ Clique clustering yields a PTAS for max-coloring interval graphs ⋮ Data aggregation in sensor networks: Balancing communication and delay costs ⋮ Latency Constrained Aggregation in Chain Networks Admits a PTAS
This page was built for publication: Latency Constrained Aggregation in Sensor Networks
