scientific article
From MaRDI portal
Publication:3742257
zbMath0604.52005MaRDI QIDQ3742257
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (10)
Finite sphere packing and sphere covering ⋮ An improved distributed data aggregation scheduling in wireless sensor networks ⋮ Note on a conjecture of Wegner ⋮ Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks ⋮ Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks ⋮ Packings, sausages and catastrophes ⋮ Approximation for a scheduling problem with application in wireless networks ⋮ Minimum-latency aggregation scheduling in wireless sensor network ⋮ Penny-packing and two-dimensional codes ⋮ On two finite covering problems of Bambah, Rogers, Woods and Zassenhaus
This page was built for publication: