Non-uniform packings

DOI10.1016/j.ipl.2021.106179OpenAlexW3197129580MaRDI QIDQ2059874

Lee-Ad J. Gottlieb, Leonid (Aryeh) Kontorovich

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.01581

zbMATH Keywords

metric spacecombinatorial problemspacking

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing unequal spheres into various containers
• A tree-based regressor that adapts to intrinsic dimension
• Using the doubling dimension to analyze the generalization of learning algorithms
• Universal Bayes consistency in metric spaces
• Note on non-uniform bin packing games
• The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
• Searching dynamic point sets in spaces with bounded doubling dimension
• Efficient Classification for Metric Data
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Bypassing the embedding
• Geometric Packing under Nonuniform Constraints
• High-Dimensional Statistics
• High-Dimensional Probability
• Near-Optimal Sample Compression for Nearest Neighbors
• Proximity Algorithms for Nearly Doubling Spaces
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Adaptive metric dimensionality reduction

This page was built for publication: Non-uniform packings