Geometric packing under non-uniform constraints

DOI10.1145/2261250.2261253zbMath1293.05243OpenAlexW2130921208MaRDI QIDQ2874559

Alina Ene, Benjamin Raichel, Sariel Har-Peled

Publication date: 7 August 2014

Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2261250.2261253

zbMATH Keywords

optimizationindependent setrounding scheme

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Approximation algorithms (68W25)

Related Items (5)

Constructing planar support for non-piercing regions ⋮ Packing and covering with non-piercing regions ⋮ Unnamed Item ⋮ Local search strikes again: PTAS for variants of geometric covering and packing ⋮ A tight analysis of geometric local search

This page was built for publication: Geometric packing under non-uniform constraints