8 citations · 14 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018★ 8 cited
Online scheduling of jobs with favorite machines
Cong Chen, Paolo Penna, Yinfeng Xu
This work introduces a natural variant of the online machine scheduling problem on unrelated machines, which we refer to as the favorite machine model. In this model, each job has…
cs.DS2013★ 3 cited
An approximation algorithm for the Bandpass-2 problem
Weitian Tong, Zhi-Zhong Chen, Lusheng Wang +4
The general Bandpass- problem is NP-hard and can be approximated by a reduction into the weighted -set packing problem, with a worst case performance ratio of . When…