Martin Böhm

activity

20142026

most citedDiscovering and Certifying Lower Bounds for the Online Bin Stretching Problem

2 citations · 4 across the 7 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.DS2017

Nested Convex Bodies are Chaseable

Nikhil Bansal, Martin Böhm, Marek Eliáš +2

In the Convex Body Chasing problem, we are given an initial point $v_{0}$ in $R^{d}$ and an online sequence of $n$ convex bodies $F_{1}, ..., F_{n}$ . When we receive $F_{i}$ , we are required…

cs.DS2017

On Packet Scheduling with Adversarial Jamming and Speedup

Martin Böhm, Łukasz Jeż, Jiří Sgall +1

In Packet Scheduling with Adversarial Jamming packets of arbitrary sizes arrive over time to be transmitted over a channel in which instantaneous jamming errors occur at times chos…