The content discusses algorithms for solving geometric knapsack problems efficiently. It introduces structured packings like N ∗-boxes and S-boxes for hypercubes and rectangles, achieving (1 + ϵ)-approximations. The dynamic algorithm supports insertion, deletion, estimation, and querying operations. Key techniques include easily guessable packings and an indirect guessing framework.
In un'altra lingua
dal contenuto originale
arxiv.org
Approfondimenti chiave tratti da
by Moritz Buche... alle arxiv.org 03-04-2024
https://arxiv.org/pdf/2403.00536.pdfDomande più approfondite