84 citations · 241 across the 22 of their papers we have counts for
3 papers · 1 filter
Batch Coloring of Graphs
Joan Boyar, Leah Epstein, Lene M. Favrholdt +2
In graph coloring problems, the goal is to assign a positive integer color to each vertex of an input graph such that adjacent vertices do not receive the same color assignment. Fo…
Online bin packing with cardinality constraints resolved
János Balogh, József Békési, György Dósa +2
Cardinality constrained bin packing or bin packing with cardinality constraints is a basic bin packing problem. In the online version with the parameter k \geq 2, items having size…
Online Bounded Analysis
Joan Boyar, Leah Epstein, Lene M. Favrholdt +2
Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results…