Showing 2026Show all
2 papers · 1 filter
cs.CG2026
Geometric Bin Packing Beyond Convexity: Approximation Schemes without Augmentation
Lucas de Oliveira Silva, Elisa Dell'Arriva, Flávio Keidi Miyazawa
We study the geometric bin packing problem for simple polygonal regions, i.e., non-degenerate, connected, rational regions, in the minimum number of unit-square bins, allowing only…
cs.DS2026
Vertex Cover Problem with Advice
Lucas de Oliveira Silva, Lehilton Lelis Chaves Pedrosa
We study the minimum Vertex Cover problem under two non-adaptive offline advice models, where predictions about a fixed optimum solution are provided once as part of the input. The…