Non-Uniform Packings

Lee Ad Gottlieb, Aryeh Kontorovich

Research output: Contribution to journalArticlepeer-review

Abstract

We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its non-uniform packing number. We show that the non-uniform packing number can be upper-bounded in terms of the average radius of the balls, resulting in bounds of the familiar classical form.

Original languageEnglish
Article number106179
JournalInformation Processing Letters
Volume174
DOIs
StatePublished - 1 Mar 2022

Keywords

  • Combinatorial problems
  • Metric space
  • Packing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Non-Uniform Packings'. Together they form a unique fingerprint.

Cite this