output
20072026
most citedPreference-based Online Learning with Dueling Bandits: A Survey

23 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2018

Online Connected Dominating Set Leasing

Christine Markarian

We introduce the \emph{Online Connected Dominating Set Leasing} problem (OCDSL) in which we are given an undirected connected graph , a set of lease types…

cs.DS2017★ 1 cited

A Tight Approximation for Fully Dynamic Bin Packing without Bundling

Björn Feldkord, Matthias Feldotto, Sören Riechers

We consider a variant of the classical Bin Packing Problem, called Fully Dynamic Bin Packing. In this variant, items of a size in must be packed in bins of unit size. In ea…

cs.DS2014

Online Top-k-Position Monitoring of Distributed Data Streams

Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide

Consider n nodes connected to a single coordinator. Each node receives an individual online data stream of numbers and, at any point in time, the coordinator has to know the k node…

cs.DS2012

Profitable Scheduling on Multiple Speed-Scalable Processors

Peter Kling, Peter Pietrzyk

We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors. Moreover, we provide a tight analysis of the algorithm's competitiveness. Ou…

cs.DS2007

On Faster Integer Calculations using Non-Arithmetic Primitives

Katharina Lürwer-Brüggemeier, Martin Ziegler

The unit cost model is both convenient and largely realistic for describing integer decision algorithms over (+,*). Additional operations like division with remainder or bitwise co…