Number of items: 8.
Baptiste, Ph., Carlier, J., Kononov, A., Queyranne, M., Sevastyanov, S. and Sviridenko, Maxim.
(2012)
Integer preemptive scheduling on parallel machines.
Operations Research Letters, Vol.40
(No.6).
pp. 440-444.
ISSN 0167-6377
Fleischer, L., Goemans, M. X., Mirrokni, V. S. and Sviridenko, Maxim.
(2011)
Tight Approximation Algorithms for Maximum Separable Assignment Problems.
Mathematics of Operations Research, 36
(3).
pp. 416-431.
ISSN 0364-765X
Bansal, Nikhil, Chen, Ning, Cherniavsky, Neva, Rurda, Atri, Schieber, Baruch and Sviridenko, Maxim.
(2010)
Dynamic pricing for impatient bidders.
ACM Transactions on Algorithms , Vol.6
(No.2).
pp. 1-21.
ISSN 1549-6325
Lee, Jon, Mirrokni, Vahab S., Nagarajan, Viswanath and Sviridenko, Maxim.
(2010)
Maximizing nonmonotone submodular functions under matroid or knapsack constraints.
SIAM Journal on Discrete Mathematics, Vol.23
(No.4).
pp. 2053-2078.
ISSN 0895-4801
Bansal, Nikhil, Caprara, Alberto and Sviridenko, Maxim.
(2010)
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing.
SIAM Journal on Computing, 39
(4).
pp. 1256-1278.
ISSN 0097-5397
Lee, Jon, Mirrokni, Vahab S., Nagarajan, Viswanath and Sviridenko, Maxim
(2009)
Non-monotone submodular maximization under matroid and knapsack constraints.
In: 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda, Maryland, 31 May - 2 Jun 2009. Published in: STOC '09 Proceedings of the 41st annual ACM symposium on Theory of computing
p. 323.
Lee, Jon, Sviridenko, Maxim and Vondrák, Jan.
(2009)
Submodular maximization over multiple matroids via generalized exchange properties.
Lecture Notes in Computer Science, Vol.5687
.
pp. 244-257.
ISSN 0302-9743
Bansal, Nikhil, Coppersmith, Don and Sviridenko, Maxim.
(2008)
Improved Approximation Algorithms for Broadcast Scheduling.
SIAM Journal on Computing, 38
(3).
pp. 1157-1174.
ISSN 0097-5397
This list was generated on Wed Jun 19 17:12:48 2013 BST.