2 citations · 2 across the 6 of their papers we have counts for
3 papers · 1 filter
Learning Minimum Linear Arrangement of Cliques and Lines
Julien Dallot, Maciej Pacut, Marcin Bienkowski +2
In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the nodes of an undirected graph into a permutation so that the total stretch of the edges is m…
Contract Scheduling with Distributional and Multiple Advice
Spyros Angelopoulos, Marcin Bienkowski, Christoph Dürr +1
Contract scheduling is a widely studied framework for designing real-time systems with interruptible capabilities. Previous work has showed that a prediction on the interruption ti…
Online Disjoint Set Covers: Randomization is not Necessary
Marcin Bienkowski, Jarosław Byrka, Łukasz Jeż
In the online disjoint set covers problem, the edges of a hypergraph are revealed online, and the goal is to partition them into a maximum number of disjoint set covers. That is, n…