On the complexity of covering points by guillotine cuts

arXiv:2602.17294v2 Announce Type: replace Abstract: We show that the problem of covering a set of points in the plane with a minimum number of guillotine cuts is NP-complete. To that end, first we present a new NP-completeness proof for the problem of covering points with disj...

🔗 Read more: https://arxiv.org/abs/2602.17294

#News #Policy #Academic