A Tight Lower Bound for Compact Set Packing
Huairui Chu
TL;DR
This paper presents a straightforward proof establishing a tight lower bound for the parameterized compact set packing problem, leveraging the Exponential Time Hypothesis (ETH).
Contribution
It provides a simple and clear proof of the lower bound, enhancing understanding of the problem's computational complexity.
Findings
Establishes a tight lower bound based on ETH
Simplifies the proof of the lower bound
Clarifies the computational hardness of the problem
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · Manufacturing Process and Optimization · Scheduling and Optimization Algorithms