Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Latency-constrained aggregation in sensor networks

From MaRDI portal
Publication:2930288
Jump to:navigation, search

DOI10.1145/1644015.1644028zbMath1300.68063OpenAlexW2160543991MaRDI QIDQ2930288

No author found.

Publication date: 18 November 2014

Published in: (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/7e7324cb-e274-4808-91d3-641b8fe2fb1c


zbMATH Keywords

No records found.


Mathematics Subject Classification ID

No records found.


Related Items (7)

Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem ⋮ A PTAS for the horizontal rectangle stabbing problem ⋮ Joint replenishment meets scheduling ⋮ Approximation algorithms for the joint replenishment problem with deadlines ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ Online Algorithms for Multilevel Aggregation ⋮ New results on multi-level aggregation




This page was built for publication: Latency-constrained aggregation in sensor networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2930288&oldid=15913831"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki