10 citations · 10 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2012
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
Elisabeth Günther, Olaf Maurer, Nicole Megow +1
We propose a new approach to competitive analysis in online scheduling by introducing the novel concept of competitive-ratio approximation schemes. Such a scheme algorithmically co…
cs.DS2010★ 10 cited
The Sorting Buffer Problem is NP-hard
Ho-Leung Chan, Nicole Megow, Rob van Stee +1
We consider the offline sorting buffer problem. The input is a sequence of items of different types. All items must be processed one by one by a server. The server is equipped with…