[HTML][HTML] Parameterized complexity of configuration integer programs
Configuration integer programs (IP) have been key in the design of algorithms for NP-hard
high-multiplicity problems. First, we develop fast exact (exponential-time) algorithms for …
high-multiplicity problems. First, we develop fast exact (exponential-time) algorithms for …
Improved approximation for two-dimensional vector multiple knapsack
T Cohen, A Kulik, H Shachnai - Computational Geometry, 2025 - Elsevier
We study the uniform 2-dimensional vector multiple knapsack (2VMK) problem, a natural
variant of multiple knapsack arising in real-world applications such as virtual machine …
variant of multiple knapsack arising in real-world applications such as virtual machine …
Tight vector bin packing with few small items via fast exact matching in multigraphs
A Lassota, A Łukasiewicz, A Polak - ar** with such computationally hard questions e ciently. The rst approach …