A Tight Lower Bound for Compact Set Packing

2023/02/18 by Huairui Chu, Chu, Huairui
Engineering · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Manufacturing Process and Optimization #Optimization and Packing Problems #Scheduling and Optimization Algorithms

paper · pdf · doi:10.48550/arxiv.2302.09220

openalex publication_date 2023/02/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This note is devoted to show a simple proof of a tight lower bound of the parameterized compact set packing problem, based on ETH.

Related

• On the parameterized complexity of Compact Set Packing
• Compact Packings are not always the Densest
• A Note on the Size-Sensitive Packing Lemma
• Packing Sets
• Minimum packing density for sets of four integers