A Tight Lower Bound for Compact Set Packing

Published 18 Feb 2023 in cs.CC | (2302.09220v1)

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.

Authors (1)

Citations (1)

No one has generated a summary of this paper yet.

No one has generated a video about this paper yet.

No one has generated a whiteboard explanation for this paper yet.

We haven't generated a list of open problems mentioned in this paper yet.

We haven't generated follow-up questions for this paper yet.