Maxim Sviridenko
Maxim Sviridenko
Yahoo Research
Dirección de correo verificada de
Citado por
Citado por
A note on maximizing a submodular set function subject to a knapsack constraint
M Sviridenko
Operations Research Letters 32 (1), 41-43, 2004
Maximizing nonmonotone submodular functions under matroid or knapsack constraints
J Lee, VS Mirrokni, V Nagarajan, M Sviridenko
SIAM Journal on Discrete Mathematics 23 (4), 2053-2078, 2010
Pipage rounding: A new method of constructing algorithms with proven performance guarantee
AA Ageev, MI Sviridenko
Journal of Combinatorial Optimization 8 (3), 307-328, 2004
Tight approximation algorithms for maximum separable assignment problems
L Fleischer, MX Goemans, VS Mirrokni, M Sviridenko
Mathematics of Operations Research 36 (3), 416-431, 2011
The santa claus problem
N Bansal, M Sviridenko
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
Buffer overflow management in QoS switches
A Kesselman, Z Lotker, Y Mansour, B Patt-Shamir, B Schieber, ...
SIAM Journal on Computing 33 (3), 563-583, 2004
Dynamic placement for clustered web applications
A Karve, T Kimbrel, G Pacifici, M Spreitzer, M Steinder, M Sviridenko, ...
Proceedings of the 15th international conference on World Wide Web, 595-604, 2006
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
H Kaplan, M Lewenstein, N Shafrir, M Sviridenko
Journal of the ACM (JACM) 52 (4), 602-626, 2005
Approximation schemes for minimizing average weighted completion time with release dates
F Afrati, E Bampis, C Chekuri, D Karger, C Kenyon, S Khanna, I Milis, ...
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
An improved approximation algorithm for the metric uncapacitated facility location problem
M Sviridenko
International Conference on Integer Programming and Combinatorial …, 2002
Submodular maximization over multiple matroids via generalized exchange properties
J Lee, M Sviridenko, J Vondrák
Mathematics of Operations Research 35 (4), 795-806, 2010
Optimal approximation for submodular and supermodular optimization with bounded curvature
M Sviridenko, J Vondrák, J Ward
Mathematics of Operations Research 42 (4), 1197-1218, 2017
Approximation algorithms for maximum coverage and max cut with given sizes of parts
AA Ageev, MI Sviridenko
International Conference on Integer Programming and Combinatorial …, 1999
The diameter of a long-range percolation graph
D Coppersmith, D Gamarnik, M Sviridenko
Random Structures and Algorithms 21 (1), 1-13, 2002
Bin packing in multiple dimensions: inapproximability results and approximation schemes
N Bansal, JR Correa, C Kenyon, M Sviridenko
Mathematics of operations research 31 (1), 31-49, 2006
A constant approximation algorithm for the one-warehouse multiretailer problem
R Levi, R Roundy, D Shmoys, M Sviridenko
Management Science 54 (4), 763-776, 2008
Improved approximation algorithms for multidimensional bin packing problems
N Bansal, A Caprara, M Sviridenko
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
A new approximation method for set covering problems, with applications to multidimensional bin packing
N Bansal, A Caprara, M Sviridenko
SIAM Journal on Computing 39 (4), 1256-1278, 2009
Supermodularity and affine policies in dynamic robust optimization
DA Iancu, M Sharma, M Sviridenko
Operations Research 61 (4), 941-956, 2013
Discretization orders for distance geometry problems
C Lavor, J Lee, ALS John, L Liberti, A Mucherino, M Sviridenko
Optimization Letters 6 (4), 783-796, 2012
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20