Volgen
Maxim Sviridenko
Maxim Sviridenko
Yahoo Research
Geverifieerd e-mailadres voor verizonmedia.com
Titel
Geciteerd door
Geciteerd door
Jaar
A note on maximizing a submodular set function subject to a knapsack constraint
M Sviridenko
Operations Research Letters 32 (1), 41-43, 2004
8382004
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
490*2010
Pipage rounding: A new method of constructing algorithms with proven performance guarantee
AA Ageev, MI Sviridenko
Journal of Combinatorial Optimization 8, 307-328, 2004
4722004
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
434*2011
The santa claus problem
N Bansal, M Sviridenko
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
3432006
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
2932017
Buffer overflow management in QoS switches
A Kesselman, Z Lotker, Y Mansour, B Patt-Shamir, B Schieber, ...
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
2642001
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
2611999
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
2522006
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
2492005
An improved approximation algorithm for the metric uncapacitated facility location problem
M Sviridenko
International Conference on Integer Programming and Combinatorial …, 2002
2492002
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
2302010
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
1851999
The diameter of a long-range percolation graph
D Coppersmith, D Gamarnik, M Sviridenko
Random Structures and Algorithms 21 (1), 1-13, 2002
1582002
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
1572006
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
1472008
An algorithm for online k-means clustering
E Liberty, R Sriharsha, M Sviridenko
2016 Proceedings of the eighteenth workshop on algorithm engineering and …, 2016
1252016
Dynamic application placement under service and memory constraints
T Kimbrel, M Steinder, M Sviridenko, A Tantawi
US Patent App. 11/110,766, 2006
1242006
Supermodularity and affine policies in dynamic robust optimization
DA Iancu, M Sharma, M Sviridenko
Operations Research 61 (4), 941-956, 2013
1222013
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
1162009
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20