Maxim Sviridenko

Publication Activity (10 Years)

Years Active: 1998-2023
Publications (10 Years): 34

Top Venues

CoRR

Math. Oper. Res.

APPROX-RANDOM

ACM Trans. Algorithms

Publications

Kyriakos Axiotis, Maxim Sviridenko
Gradient Descent Converges Linearly for Logistic Regression on Separable Data. ICML (2023)
Kyriakos Axiotis, Maxim Sviridenko
Gradient Descent Converges Linearly for Logistic Regression on Separable Data. CoRR (2023)
Kyriakos Axiotis, Maxim Sviridenko
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime. ICML (2022)
Kyriakos Axiotis, Maxim Sviridenko
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime. CoRR (2022)
Kyriakos Axiotis, Maxim Sviridenko
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. J. Mach. Learn. Res. 22 (2021)
Shaunak Mishra, Changwei Hu, Manisha Verma, Kevin Yen, Yifan Hu, Maxim Sviridenko
TSI: An Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity. CIKM (2021)
Shaunak Mishra, Mikhail Kuznetsov, Gaurav Srivastava, Maxim Sviridenko
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search. CoRR (2021)
Kyriakos Axiotis, Maxim Sviridenko
Local Search Algorithms for Rank-Constrained Convex Optimization. ICLR (2021)
Kyriakos Axiotis, Maxim Sviridenko
Local Search Algorithms for Rank-Constrained Convex Optimization. CoRR (2021)
Shaunak Mishra, Mikhail Kuznetsov, Gaurav Srivastava, Maxim Sviridenko
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search. KDD (2021)
Shaunak Mishra, Changwei Hu, Manisha Verma, Kevin Yen, Yifan Hu, Maxim Sviridenko
TSI: an Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity. CoRR (2021)
Kyriakos Axiotis, Maxim Sviridenko
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. ICML (2020)
Kyriakos Axiotis, Maxim Sviridenko
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. CoRR (2020)
Benjamin Moseley, Maxim Sviridenko
Submodular Optimization with Contention Resolution Extensions. APPROX-RANDOM (2019)
Róbert Busa-Fekete, Krzysztof Dembczynski, Alexander Golovnev, Kalina Jasinska, Mikhail Kuznetsov, Maxim Sviridenko, Chao Xu
On the computational complexity of the probabilistic label tree algorithms. CoRR (2019)
Lehilton L. C. Pedrosa, Maxim Sviridenko
Integrated Supply Chain Management via Randomized Rounding. INFORMS J. Comput. 30 (1) (2018)
Konstantin Makarychev, Maxim Sviridenko
Solving Optimization Problems with Diseconomies of Scale via Decoupling. J. ACM 65 (6) (2018)
Ruggiero Cavallo, Maxim Sviridenko, Christopher A. Wilkens
Matching Auctions for Search and Native Ads. EC (2018)
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko
Energy-efficient scheduling and routing via randomized rounding. J. Sched. 21 (1) (2018)
Ruggiero Cavallo, Prabhakar Krishnamurthy, Maxim Sviridenko, Christopher A. Wilkens
Sponsored Search Auctions with Rich Ads. WWW (2017)
Ruggiero Cavallo, Prabhakar Krishnamurthy, Maxim Sviridenko, Christopher A. Wilkens
Sponsored Search Auctions with Rich Ads. CoRR (2017)
Christopher Musco, Maxim Sviridenko, Justin Thaler
Determining Tournament Payout Structures for Daily Fantasy Sports. ALENEX (2017)
Edo Liberty, Maxim Sviridenko
Greedy Minimization of Weakly Supermodular Set Functions. APPROX-RANDOM (2017)
Konstantin Makarychev, Maxim Sviridenko
Maximizing Polynomials Subject to Assignment Constraints. ACM Trans. Algorithms 13 (4) (2017)
Maxim Sviridenko, Jan Vondrák, Justin Ward
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature. Math. Oper. Res. 42 (4) (2017)
Edo Liberty, Ram Sriharsha, Maxim Sviridenko
An Algorithm for Online K-Means Clustering. ALENEX (2016)
Ravishankar Krishnaswamy, Maxim Sviridenko
Inapproximability of the Multilevel Uncapacitated Facility Location Problem. ACM Trans. Algorithms 13 (1) (2016)
Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward
A Bi-Criteria Approximation Algorithm for k-Means. APPROX-RANDOM (2016)
Martin Skutella, Maxim Sviridenko, Marc Uetz
Unrelated Machine Scheduling with Stochastic Processing Times. Math. Oper. Res. 41 (3) (2016)
Marcin Mucha, Maxim Sviridenko
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. Math. Oper. Res. 41 (1) (2016)
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. Algorithmica 76 (2) (2016)
Christopher Musco, Maxim Sviridenko, Justin Thaler
Determining Tournament Payout Structures for Daily Fantasy Sports. CoRR (2016)
Marek Adamczyk, Maxim Sviridenko, Justin Ward
Submodular Stochastic Probing on Matroids. Math. Oper. Res. 41 (3) (2016)
Aris Anagnostopoulos, Ruggiero Cavallo, Stefano Leonardi, Maxim Sviridenko
Bidding Strategies for Fantasy-Sports Auctions. WINE (2016)
Christos Boutsidis, Edo Liberty, Maxim Sviridenko
Greedy Minimization of Weakly Supermodular Set Functions. CoRR (2015)
Maxim Sviridenko, Jan Vondrák, Justin Ward
Optimal approximation for submodular and supermodular optimization with bounded curvature. SODA (2015)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young
Approximation algorithms for the joint replenishment problem with deadlines. J. Sched. 18 (6) (2015)
Sungjin Im, Maxim Sviridenko
New Approximations for Broadcast Scheduling via Variants of α-point Rounding. SODA (2015)
Konstantin Makarychev, Warren Schudy, Maxim Sviridenko
Concentration inequalities for nonlinear matroid intersection. Random Struct. Algorithms 46 (3) (2015)
Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward
A bi-criteria approximation algorithm for k Means. CoRR (2015)
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. CoRR (2014)
Konstantin Makarychev, Maxim Sviridenko
Solving Optimization Problems with Diseconomies of Scale via Decoupling. FOCS (2014)
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. CoRR (2014)
Lehilton L. C. Pedrosa, Maxim Sviridenko
Integrated Supply Chain Management via Randomized Rounding. LATIN (2014)
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. ACM Trans. Algorithms 10 (4) (2014)
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
Polynomial-Time Approximation Schemes for Circle Packing Problems. ESA (2014)
Konstantin Makarychev, Maxim Sviridenko
Optimization Problems with Diseconomies of Scale via Decoupling. CoRR (2014)
Marek Adamczyk, Maxim Sviridenko, Justin Ward
Submodular Stochastic Probing on Matroids. STACS (2014)
Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan
Preemptive and non-preemptive generalized min sum set cover. Math. Program. 145 (1-2) (2014)
Edo Liberty, Ram Sriharsha, Maxim Sviridenko
An Algorithm for Online K-Means Clustering. CoRR (2014)
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko
Energy Efficient Scheduling and Routing via Randomized Rounding. CoRR (2014)
Martin Skutella, Maxim Sviridenko, Marc Uetz
Stochastic Scheduling on Unrelated Machines. STACS (2014)
Maxim Sviridenko, Justin Ward
Tight Bounds for Submodular and Supermodular Optimization with Bounded Curvature. CoRR (2013)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young
Approximation Algorithms for the Joint Replenishment Problem with Deadlines. ICALP (1) (2013)
Tim Nonner, Maxim Sviridenko
An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem. IPCO (2013)
Sungjin Im, Maxim Sviridenko
Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling. CoRR (2013)
Maxim Sviridenko, Andreas Wiese
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. IPCO (2013)
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko
Energy Efficient Scheduling and Routing via Randomized Rounding. FSTTCS (2013)
Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang
A Harmonic Algorithm for the 3D Strip Packing Problem. SIAM J. Comput. 42 (2) (2013)
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Oper. Res. 61 (4) (2013)
Marcin Mucha, Maxim Sviridenko
No-Wait Flowshop Scheduling is as Hard as Asymmetric Traveling Salesman Problem CoRR (2013)
Marek Adamczyk, Maxim Sviridenko, Justin Ward
Submodular Stochastic Probing on Matroids. CoRR (2013)
Maxim Sviridenko, Justin Ward
Large Neighborhood Local Search for the Maximum Set Packing Problem CoRR (2013)
Dan Andrei Iancu, Mayank Sharma, Maxim Sviridenko
Supermodularity and Affine Policies in Dynamic Robust Optimization. Oper. Res. 61 (4) (2013)
Marcin Mucha, Maxim Sviridenko
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. ICALP (1) (2013)
Maxim Sviridenko, Justin Ward
Large Neighborhood Local Search for the Maximum Set Packing Problem. ICALP (1) (2013)
Jon Lee, Maxim Sviridenko, Jan Vondrák
Matroid Matching: The Power of Local Search. SIAM J. Comput. 42 (1) (2013)
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40 (6) (2012)
Warren Schudy, Maxim Sviridenko
Concentration and moment inequalities for polynomials of independent random variables. SODA (2012)
Rishi Saket, Maxim Sviridenko
New and Improved Bounds for the Minimum Set Cover Problem. APPROX-RANDOM (2012)
Ravishankar Krishnaswamy, Maxim Sviridenko
Inapproximability of the multi-level uncapacitated facility location problem. SODA (2012)
Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko
Discretization orders for distance geometry problems. Optim. Lett. 6 (4) (2012)
Maxim Sviridenko
A note on the Kenyon-Remila strip-packing algorithm. Inf. Process. Lett. 112 (1-2) (2012)
Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan
Preemptive and Non-Preemptive Generalized Min Sum Set Cover. STACS (2012)
Konstantin Makarychev, Warren Schudy, Maxim Sviridenko
Concentration inequalities for nonlinear matroid intersection. SODA (2012)
Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko
A Complete 4-parametric complexity classification of short shop scheduling problems. J. Sched. 15 (4) (2012)
Warren Schudy, Maxim Sviridenko
Concentration and Moment Inequalities for Polynomials of Independent Random Variables CoRR (2011)
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159 (5) (2011)
Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
Tight Approximation Algorithms for Maximum Separable Assignment Problems. Math. Oper. Res. 36 (3) (2011)
Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko
Sum edge coloring of multigraphs via configuration LP. ACM Trans. Algorithms 7 (2) (2011)
Konstantin Makarychev, Maxim Sviridenko
Maximizing Polynomials Subject to Assignment Constraints. ICALP (1) (2011)
Jon Lee, Maxim Sviridenko, Jan Vondrák
Matroid matching: the power of local search. STOC (2010)
Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
Dynamic pricing for impatient bidders. ACM Trans. Algorithms 6 (2) (2010)
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. ICALP (1) (2010)
Jon Lee, Maxim Sviridenko, Jan Vondrák
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. Math. Oper. Res. 35 (4) (2010)
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. SIAM J. Discret. Math. 23 (4) (2010)
Viswanath Nagarajan, Maxim Sviridenko
On the maximum quadratic assignment problem. SODA (2009)
Refael Hassin, Asaf Levin, Maxim Sviridenko
Approximating the minimum quadratic assignment problems. ACM Trans. Algorithms 6 (1) (2009)
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
Integrality Property in Preemptive Parallel Machine Scheduling. CSR (2009)
Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko
Complete Complexity Classification of Short Shop Scheduling. CSR (2009)
Eric Allender, Vladlen Koltun, Maxim Sviridenko
Special Section On The Thirty-Ninth Annual ACM Symposium On Theory Of Computing (STOC 2007). SIAM J. Comput. 39 (3) (2009)
Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko
On Hardness of Pricing Items for Single-Minded Bidders. APPROX-RANDOM (2009)
Viswanath Nagarajan, Maxim Sviridenko
Tight Bounds for Permutation Flow Shop Scheduling. Math. Oper. Res. 34 (2) (2009)
Jon Lee, Maxim Sviridenko, Jan Vondrák
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. APPROX-RANDOM (2009)
Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. ISAAC (2009)
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
Non-monotone submodular maximization under matroid and knapsack constraints CoRR (2009)
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
Non-monotone submodular maximization under matroid and knapsack constraints. STOC (2009)
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing. SIAM J. Comput. 39 (4) (2009)
Viswanath Nagarajan, Maxim Sviridenko
On the Maximum Quadratic Assignment Problem. Math. Oper. Res. 34 (4) (2009)
Markus Bläser, L. Shankar Ram, Maxim Sviridenko
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems. Oper. Res. Lett. 37 (3) (2009)

Maxim Sviridenko.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Maxim Sviridenko