1 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2011★ 1 cited
Approximation Algorithms for Variable-Sized and Generalized Bin Covering
Matthias Hellwig, Alexander Souza
We consider the Generalized Bin Covering (GBC) problem: We are given bin types, where each bin of type has profit and demand . Furthermore, there are items,…
cs.DS2011★ 1 cited
Buffer Overflow Management with Class Segregation
Kamal Al-Bawani, Alexander Souza
We consider a new model for buffer management of network switches with Quality of Service (QoS) requirements. A stream of packets, each attributed with a value representing its Cla…
cs.DS2010
Balanced Interval Coloring
Antonios Antoniadis, Falk Hüffner, Pascal Lenzner +2
We consider the discrepancy problem of coloring intervals with colors such that at each point on the line, the maximal difference between the number of intervals of any two…