120 citations · 268 across the 16 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Inclusion-wise extremal knapsack problems are (mostly) hard to approximate
Fabio Ciccarelli, Fabio Furini, Ulrich Pferschy +1
We study two inclusion-wise extremal variants of the 0-1 Knapsack Problem (KP). Given items with integer weights and nonnegative costs or profits, the Minimum-Cost Maximal Knap…
cs.GT2026
Scheduling with Time Dependent Utilities: Fairness and Efficiency
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
A new class of multi agent single machine scheduling problems is introduced, where each job is associated with a self interested agent with a utility function decreasing in complet…