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.
To Another Language
from source content
arxiv.org
Thông tin chi tiết chính được chắt lọc từ
by Moritz Buche... lúc arxiv.org 03-04-2024
https://arxiv.org/pdf/2403.00536.pdfYêu cầu sâu hơn