Maxim Sviridenko - Concepedia

Author

Maxim Sviridenko

IBM Research - Thomas J. Watson Research Center

Also Known As

M. I. Sviridenko, M.I. Sviridenko, Maxim I. Sviridenko, Maxim Sviridenko, Sviridenko, Maxim

173

Publications

Citations

H-Index

Concepts

All Affiliations

IBM Research - Thomas J. Watson Research Center IBM (United States)Yahoo (United States)University of Warwick Tel Aviv University

About

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

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	33	67	4.8K
2	Business	12	17	698
3	Education	3	3	328
4	Management	3	3	83
5	Natural Sciences	3	3	210

Maxim Sviridenko

Publications

Citations

H-Index

Page 1

	Year	Citations
A note on maximizing a submodular set function subject to a knapsack constraint Maxim Sviridenko Operations Research Letters Mathematical ProgrammingEngineeringOptimization ProblemKnapsack ProblemConstrained Optimization	2003	680
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee Alexander Ageev, Maxim Sviridenko Journal of Combinatorial Optimization Mathematical ProgrammingProven Performance GuaranteeEngineeringAlgorithmic LibraryProgram Analysis	2004	362
The Santa Claus problem Nikhil Bansal, Maxim Sviridenko Mathematical ProgrammingEngineeringOptimization ProblemSanta Claus ProblemM Kids	2006	266
Non-monotone submodular maximization under matroid and knapsack constraints Jon Lee, Vahab Mirrokni, Viswanath Nagarajan, Mathematical ProgrammingEngineeringNetwork AnalysisConstrained OptimizationComputational Complexity	2009	220
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints Jon Lee, Vahab Mirrokni, Viswanath Nagarajan, SIAM Journal on Discrete Mathematics Mathematical ProgrammingEngineeringGraph TheoryOptimization ProblemCombinatorial Problem	2010	188
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Journal of the ACM Mathematical ProgrammingDirected GraphEngineeringPlanar GraphNetwork Analysis	2005	178
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature Maxim Sviridenko, Jan Vondrák, Justin Ward Mathematics of Operations Research Numerical AnalysisMathematical ProgrammingEngineeringVariational AnalysisConstrained Optimization	2017	175
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties Jon Lee, Maxim Sviridenko, J. Vondrák Mathematics of Operations Research Mathematical ProgrammingEngineeringMatroid ConstraintsNetwork AnalysisComputational Complexity	2010	171
Buffer Overflow Management in QoS Switches Alexander Kesselman, Zvi Lotker, Yishay Mansour, SIAM Journal on Computing Admission ControlNetwork SwitchesFlow ControlEngineeringEdge Computing	2004	169
Tight approximation algorithms for maximum general assignment problems Lisa Fleischer, Michel X. Goemans, Vahab Mirrokni, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 Mathematical ProgrammingEngineeringTight Approximation AlgorithmsComputational ComplexityAdwords Assignment Problem	2006	162

Page 1