Maxim Sviridenko, Jan Vondrák, et al.
SODA 2015
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.
Maxim Sviridenko, Jan Vondrák, et al.
SODA 2015
Maxim Sviridenko
Information Processing Letters
Ravishankar Krishnaswamy, Maxim Sviridenko
SODA 2012
Konstantin Makarychev, Warren Schudy, et al.
Random Structures and Algorithms