2 citations · 3 across the 9 of their papers we have counts for
4 papers · 1 filter
Improving Online Bin Covering with Little Advice
Andrej Brodnik, Bengt J. Nilsson, Gordana Vujović
The online bin covering problem is: given an input sequence of items find a placement of the items in the maximum number of bins such that the sum of the items' sizes in each bin i…
Online Bin Covering with Exact Parameter Advice
Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic
We show an asymptotic 2/3-competitive strategy for the bin covering problem using O(b+log n) bits of advice, where b is the number of bits used to encode a rational value and n is…
Online Two-Dimensional Vector Packing with Advice
Bengt J. Nilsson, Gordana Vujovic
We consider the online two-dimensional vector packing problem, showing a lower bound of on the competitive ratio of any {\sc AnyFit} strategy for the problem. We provide str…
Online Clique Clustering
Marek Chrobak, Christoph Durr, Aleksander Fabijan +1
Clique clustering is the problem of partitioning the vertices of a graph into disjoint clusters, where each cluster forms a clique in the graph, while optimizing some objective fun…