Nikhil Bansal, Alberto Caprara, et al.
SIAM Journal on Computing
In this paper we consider a generalized version of the classical preemptive open shop problem with sum of weighted job completion times objective. The main result is a (2 + ε)-approximation algorithm for this problem. In the last section we also discuss the possibility of improving our algorithm. © 2002 Elsevier Science (USA). All rights reserved.
Nikhil Bansal, Alberto Caprara, et al.
SIAM Journal on Computing
Warren Schudy, Maxim Sviridenko
SODA 2012
Sungjin Im, Maxim Sviridenko, et al.
STACS 2012
Nikhil Bansal, Alberto Caprara, et al.
FOCS 2006