2 citations · 4 across the 8 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Uniform Universal Sets, Splitters, and Bisectors
Elisabet Burjons, Peter Rossmanith
Given a subset of size of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With…
cs.DS2025
Online General Knapsack with Reservation Costs
Elisabet Burjons, Matthias Gehnen
In the online general knapsack problem, an algorithm is presented with an item of size and value and must irrevocably choose to pack such an item into the knapsac…