Concepedia

Maxim Sviridenko

MS

Statistics

Publications

74

Citations

5.1K

H-Index

34

Active since

1999

Affiliations

IBM Research - Thomas J. Watson Research Center(Current)

IBM (United States)

Yahoo (United States)

University of Warwick

Tel Aviv University

Maxim Sviridenko is an author at IBM Research - Thomas J. Watson Research Center specializing in computer science, combinatorial optimization, and optimization.

Publications per year

1999–2018

74

Publications

74

A note on maximizing a submodular set function subject to a knapsack constraint

Maxim Sviridenko · Operations Research Letters · 2003 · 692 citations

, , +12

Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee

Alexander Ageev, Maxim Sviridenko · Journal of Combinatorial Optimization · 2004 · 372 citations

, , +8

The Santa Claus problem

Nikhil Bansal, Maxim Sviridenko · 2006 · 269 citations

, , +13

Non-monotone submodular maximization under matroid and knapsack constraints

Jon Lee, Vahab Mirrokni, Viswanath Nagarajan et al. · 2009 · 225 citations

, , +17

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints

Jon Lee, Vahab Mirrokni, Viswanath Nagarajan et al. · SIAM Journal on Discrete Mathematics · 2010 · 194 citations

, , +17

1–5 of 74