1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2020
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time
Franziska Eberle, Nicole Megow, Lukas Nölke +2
Knapsack problems are among the most fundamental problems in optimization. In the Multiple Knapsack problem, we are given multiple knapsacks with different capacities and items wit…
cs.DS2016
Online Packet Scheduling with Bounded Delay and Lookahead
Martin Böhm, Marek Chrobak, Łukasz Jeż +3
We study the online bounded-delay packet scheduling problem (BDPS), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each pac…
astro-ph.SR2009★ 1 cited
A Statistical Analysis of Sunspot Active Longitudes
Abdul Malik, Martin Bohm
This research work is based on the study of the longitudinal distribution of the most active sunspot zones on the photosphere. Sunspot data has been analyzed for 12 solar cycles (c…