팔로우
Maxim Sviridenko
Maxim Sviridenko
Yahoo Research
verizonmedia.com의 이메일 확인됨
제목
인용
인용
연도
A note on maximizing a submodular set function subject to a knapsack constraint
M Sviridenko
Operations Research Letters 32 (1), 41-43, 2004
8012004
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
464*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
4582004
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
424*2011
The santa claus problem
N Bansal, M Sviridenko
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
3292006
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
2682017
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
2592001
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
2541999
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
2532006
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
2462005
An improved approximation algorithm for the metric uncapacitated facility location problem
M Sviridenko
International Conference on Integer Programming and Combinatorial …, 2002
2452002
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
2242010
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
1721999
The diameter of a long-range percolation graph
D Coppersmith, D Gamarnik, M Sviridenko
Random Structures and Algorithms 21 (1), 1-13, 2002
1572002
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
1552006
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
1382008
Dynamic application placement under service and memory constraints
T Kimbrel, M Steinder, M Sviridenko, A Tantawi
US Patent App. 11/110,766, 2006
1242006
An algorithm for online k-means clustering
E Liberty, R Sriharsha, M Sviridenko
2016 Proceedings of the eighteenth workshop on algorithm engineering and …, 2016
1182016
Dynamic resource allocation using projected future benefits
TJ Kimbrel, R Krauthgamer, M Minkoff, BM Schieber, MI Sviridenko, ...
US Patent 7,308,415, 2007
1142007
Supermodularity and affine policies in dynamic robust optimization
DA Iancu, M Sharma, M Sviridenko
Operations Research 61 (4), 941-956, 2013
1132013
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20