Maxim Sviridenko

Artificial Intelligence · 2004–2014

A researcher in the Science corpus: 9 papers; trusts 25 researchers and is trusted by 74 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 19 citations into it; #21,607 of 35,345 by trust here, #29,412 by citations
• Computational Theory and Mathematics — 17 citations into it; #203 of 12,182 by trust here, #1,017 by citations
• Optimization & Training — 12 citations into it; #2,227 of 2,601 by trust here, #2,428 by citations
• Computer Networks and Communications — 10 citations into it; #4,202 of 9,886 by trust here, #5,340 by citations

Whom Maxim Sviridenko trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Uriel Feige
2. Alexander A. Ageev
3. George L. Nemhauser
4. Jan Vondr'ak
5. Amit Deshpande
6. Gruia Calinescu
7. Samir Khuller
8. David Freedman
9. Rafal Latala
10. Chandra Chekuri

Who trusts Maxim Sviridenko overall

1. Andreas Krause
2. Jan Vondr'ak
3. Hui-Ching Lin
4. J. Bilmes
5. Carlos Guestrin
6. Yusuke Shinohara
7. Moran Feldman
8. Ashwinkumar Badanidiyuru
9. D. Golovin
10. Chandra Chekuri

Papers from Maxim Sviridenko's perspective

Ordered by how strongly the researchers Maxim Sviridenko trusts endorse each paper. Same corpus, a different order for every researcher.

1. An analysis of approximations for maximizing submodular set functions—I
2. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
3. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)
4. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
5. Best Algorithms for Approximating the Maximum of a Submodular Set Function
6. Submodular functions and convexity
7. Optimal approximation for the submodular welfare problem in the value oracle model (Symposium on the Theory of Computing)
8. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
9. Some optimal inapproximability results
10. A threshold of ln n for approximating set cover (preliminary version)

Their papers

• A note on maximizing a submodular set function subject to a knapsack constraint (2004) — 728 citations
• Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (2004) — 411 citations
• The Santa Claus problem (2006) — 299 citations
• Non-monotone submodular maximization under matroid and knapsack constraints (2009) — 271 citations
• Tight approximation algorithms for maximum general assignment problems (2006) — 307 citations
• Optimal approximation for submodular and supermodular optimization with bounded curvature (2013) — 292 citations
• Bernstein-like Concentration and Moment Inequalities for Polynomials of Independent Random Variables: Multilinear Case (2011) — 17 citations
• Improved approximation algorithms for broadcast scheduling (2006) — 51 citations
• An Algorithm for Online K-Means Clustering (2014) — 109 citations