NP-hardness conjecture for limited-capacity covering and packing
Statement
Let be a convex body and let be an integer. The decision problem --COVER asks whether a given point set can be covered by homothets of with each homothet containing at most points; similarly, --PACK asks whether a prescribed number of homothets of can be selected subject to each homothet containing at most points.
NP-hardness conjecture. --COVER is NP-hard for every convex body and every integer . Similarly, --PACK is NP-hard for every convex body and every integer .
The conjecture extends the paper's NP-hardness results beyond the particular cases handled by its reduction to -SAT and by earlier work. Its status is not resolved in the supplied source context.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.