24 citations · 24 across the 8 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2026
A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty
Noam Goldberg, Dvir Shabtay
In this study, we investigate a robust single-machine scheduling problem under processing time uncertainty. The uncertainty is modeled using the budgeted approach, where each job h…
cs.DM2025
Robust Extensible Bin Packing and Revisiting a Convex Knapsack Problem
Noam Goldberg, Michael Poss, Yariv Marmor
We study a robust extensible bin packing problem, under a budget uncertainty model where item sizes lie in the intersection of a box with a one-norm ball. We design an algorithm ba…