Marco Bender

Available identifiers

Publication	Date of Publication	Type
Online interval scheduling with a bounded number of failures	2018-04-04	Paper
Randomized approximation and online algorithms for assignment problems	2016-02-26	Paper
Maximum generalized assignment with convex costs	2015-10-16	Paper
An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths	2015-07-01	Paper
Packing items into several bins facilitates approximating the separable assignment problem	2015-05-21	Paper
A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items	2013-09-20	Paper

This page was built for person: Marco Bender