3 papers
cs.DS2025
On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
Susanne Albers, Waldo Gálvez, Ãmer Behic Ãzdemir
We study a two-dimensional generalization of the classical Bin Packing problem, denoted as 2D Demand Bin Packing. In this context, each bin is a horizontal timeline, and rectangula…
cs.CG2025
Computing Diverse and Nice Triangulations
Waldo Gálvez, Mayank Goswami, Arturo Merino +2
We initiate the study of computing diverse triangulations to a given polygon. Given a simple -gon , an integer , a quality measure on the set of triangulatio…
cs.CG2025
A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
Waldo Gálvez, Mayank Goswami, Arturo Merino +3
There has been considerable recent interest in computing a diverse collection of solutions to a given optimization problem, both in the AI and theory communities. Given a classical…