ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CC be a convex body and let k≥3k\geq 3 be an integer. The decision problem CC-kk-COVER asks whether a given point set can be covered by homothets of CC with each homothet containing at most kk points; similarly, CC-kk-PACK asks whether a prescribed number of homothets of CC can be selected subject to each homothet containing at most kk points.

NP-hardness conjecture. CC-kk-COVER is NP-hard for every convex body CC and every integer k≥3k\geq 3. Similarly, CC-kk-PACK is NP-hard for every convex body CC and every integer k≥2k\geq 2.

The conjecture extends the paper's NP-hardness results beyond the particular cases handled by its reduction to 33-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.