3 citations · 5 across the 11 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Parallel Online Algorithms for the Bin Packing Problem
Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich +1
We study \emph{parallel} online algorithms: For some fixed integer , a collective of parallel processes that perform online decisions on the same sequence of events forms a…
cs.CG2019
Packing Disks into Disks with Optimal Worst-Case Density
Sándor P. Fekete, Phillip Keldenich, Christian Scheffer
We provide a tight result for a fundamental problem arising from packing disks into a circular container: The critical density of packing disks in a disk is 0.5. This implies that…