Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks

DOI10.1007/978-3-319-12691-3_13zbMath1358.94027OpenAlexW2211200488MaRDI QIDQ2942390

No author found.

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_13

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks ⋮ An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models ⋮ Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks

Cites Work

• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• Optimal tracking of distributed heavy hitters and quantiles
• Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Computing and Combinatorics
• Aggregation operators. New trends and applications