5 citations · 11 across the 7 of their papers we have counts for
7 papers
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…
Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide +1
Consider a problem in which jobs that are classified into types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the ma…
Monitoring of Domain-Related Problems in Distributed Data Streams
Pascal Bemmann, Felix Biermeier, Jan Bürmann +10
Consider a network in which distributed nodes are connected to a single server. Each node continuously observes a data stream consisting of one value per discrete time step. Th…
Cost-efficient Scheduling on Machines from the Cloud
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide +1
We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine…
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
Maximilian Drees, Matthias Feldotto, Sören Riechers +1
In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands,…
Non-Preemptive Scheduling on Machines with Setup Times
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide +1
Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s tim…