Abstract
In this paper, we present a new proof for a well-known inequality, conjectured by Zassenhaus in 1947 and proved independently by Groemer in 1960 and Oler in 1961. The inequality gives an upper bound for the number of nonoverlapping unit discs whose centers can be packed into a compact convex region, and recently obtains a lot of applications in study of sensor networks.
| Original language | English |
|---|---|
| Article number | 1250014 |
| Journal | Discrete Mathematics, Algorithms and Applications |
| Volume | 4 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Jun 2012 |
Keywords
- Disc packing
- Sensor network
Fingerprint
Dive into the research topics of 'A new proof for Zassenhaus-Groemer-Oler inequality'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver