Maxim Sviridenko

176 papers A* 38A 10B 12C 1Misc 2Journal 91Unranked 21
YearRankTypeTitle / Venue / Authors
2023 A* conf
Gradient Descent Converges Linearly for Logistic Regression on Separable Data.
ICML
Kyriakos Axiotis, Maxim Sviridenko
2023 J jnl
Gradient Descent Converges Linearly for Logistic Regression on Separable Data.
CoRR
Kyriakos Axiotis, Maxim Sviridenko
2022 A* conf
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime.
ICML
Kyriakos Axiotis, Maxim Sviridenko
2022 J jnl
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime.
CoRR
Kyriakos Axiotis, Maxim Sviridenko
2021 A* conf
Local Search Algorithms for Rank-Constrained Convex Optimization.
ICLR
Kyriakos Axiotis, Maxim Sviridenko
2021 J jnl
Local Search Algorithms for Rank-Constrained Convex Optimization.
CoRR
Kyriakos Axiotis, Maxim Sviridenko
2021 J jnl
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding.
J. Mach. Learn. Res.
Kyriakos Axiotis, Maxim Sviridenko
2021 A conf
TSI: An Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity.
CIKM
Shaunak Mishra, Changwei Hu, Manisha Verma, Kevin Yen, Yifan Hu, Maxim Sviridenko
2021 J jnl
TSI: an Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity.
CoRR
Shaunak Mishra, Changwei Hu, Manisha Verma, Kevin Yen, Yifan Hu, Maxim Sviridenko
2021 A* conf
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search.
KDD
Shaunak Mishra, Mikhail Kuznetsov, Gaurav Srivastava, Maxim Sviridenko
2021 J jnl
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search.
CoRR
Shaunak Mishra, Mikhail Kuznetsov, Gaurav Srivastava, Maxim Sviridenko
2020 A* conf
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding.
ICML
Kyriakos Axiotis, Maxim Sviridenko
2020 J jnl
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding.
CoRR
Kyriakos Axiotis, Maxim Sviridenko
2019 J jnl
On the computational complexity of the probabilistic label tree algorithms.
CoRR
Róbert Busa-Fekete, Krzysztof Dembczynski, Alexander Golovnev, Kalina Jasinska, Mikhail Kuznetsov, Maxim Sviridenko, Chao Xu
2019 — conf
Submodular Optimization with Contention Resolution Extensions.
APPROX-RANDOM
Benjamin Moseley, Maxim Sviridenko
2018 J jnl
Energy-efficient scheduling and routing via randomized rounding.
J. Sched.
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko
2018 J jnl
Integrated Supply Chain Management via Randomized Rounding.
INFORMS J. Comput.
Lehilton L. C. Pedrosa, Maxim Sviridenko
2018 A* conf
Matching Auctions for Search and Native Ads.
EC
Ruggiero Cavallo, Maxim Sviridenko, Christopher A. Wilkens
2018 J jnl
Solving Optimization Problems with Diseconomies of Scale via Decoupling.
J. ACM
Konstantin Makarychev, Maxim Sviridenko
2017 A conf
Determining Tournament Payout Structures for Daily Fantasy Sports.
ALENEX
Christopher Musco, Maxim Sviridenko, Justin Thaler
2017 — conf
Greedy Minimization of Weakly Supermodular Set Functions.
APPROX-RANDOM
Edo Liberty, Maxim Sviridenko
2017 J jnl
Maximizing Polynomials Subject to Assignment Constraints.
ACM Trans. Algorithms
Konstantin Makarychev, Maxim Sviridenko
2017 J jnl
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature.
Math. Oper. Res.
Maxim Sviridenko, Jan Vondrák, Justin Ward
2017 A* conf
Sponsored Search Auctions with Rich Ads.
WWW
Ruggiero Cavallo, Prabhakar Krishnamurthy, Maxim Sviridenko, Christopher A. Wilkens
2017 J jnl
Sponsored Search Auctions with Rich Ads.
CoRR
Ruggiero Cavallo, Prabhakar Krishnamurthy, Maxim Sviridenko, Christopher A. Wilkens
2016 — conf
A Bi-Criteria Approximation Algorithm for k-Means.
APPROX-RANDOM
Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward
2016 A conf
An Algorithm for Online K-Means Clustering.
ALENEX
Edo Liberty, Ram Sriharsha, Maxim Sviridenko
2016 — conf
Bidding Strategies for Fantasy-Sports Auctions.
WINE
Aris Anagnostopoulos, Ruggiero Cavallo, Stefano Leonardi, Maxim Sviridenko
2016 J jnl
Determining Tournament Payout Structures for Daily Fantasy Sports.
CoRR
Christopher Musco, Maxim Sviridenko, Justin Thaler
2016 J jnl
Inapproximability of the Multilevel Uncapacitated Facility Location Problem.
ACM Trans. Algorithms
Ravishankar Krishnaswamy, Maxim Sviridenko
2016 J jnl
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem.
Math. Oper. Res.
Marcin Mucha, Maxim Sviridenko
2016 J jnl
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems.
Algorithmica
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
2016 J jnl
Submodular Stochastic Probing on Matroids.
Math. Oper. Res.
Marek Adamczyk, Maxim Sviridenko, Justin Ward
2016 J jnl
Unrelated Machine Scheduling with Stochastic Processing Times.
Math. Oper. Res.
Martin Skutella, Maxim Sviridenko, Marc Uetz
2015 J jnl
A bi-criteria approximation algorithm for k Means.
CoRR
Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward
2015 J jnl
Approximation algorithms for the joint replenishment problem with deadlines.
J. Sched.
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young
2015 J jnl
Concentration inequalities for nonlinear matroid intersection.
Random Struct. Algorithms
Konstantin Makarychev, Warren Schudy, Maxim Sviridenko
2015 J jnl
Greedy Minimization of Weakly Supermodular Set Functions.
CoRR
Christos Boutsidis, Edo Liberty, Maxim Sviridenko
2015 A* conf
New Approximations for Broadcast Scheduling via Variants of α-point Rounding.
SODA
Sungjin Im, Maxim Sviridenko
2015 A* conf
Optimal approximation for submodular and supermodular optimization with bounded curvature.
SODA
Maxim Sviridenko, Jan Vondrák, Justin Ward
2014 J jnl
An Algorithm for Online K-Means Clustering.
CoRR
Edo Liberty, Ram Sriharsha, Maxim Sviridenko
2014 J jnl
Energy Efficient Scheduling and Routing via Randomized Rounding.
CoRR
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko
2014 B conf
Integrated Supply Chain Management via Randomized Rounding.
LATIN
Lehilton L. C. Pedrosa, Maxim Sviridenko
2014 J jnl
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm.
CoRR
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
2014 J jnl
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm.
ACM Trans. Algorithms
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
2014 J jnl
Optimization Problems with Diseconomies of Scale via Decoupling.
CoRR
Konstantin Makarychev, Maxim Sviridenko
2014 A conf
Polynomial-Time Approximation Schemes for Circle Packing Problems.
ESA
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
2014 J jnl
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems.
CoRR
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
2014 J jnl
Preemptive and non-preemptive generalized min sum set cover.
Math. Program.
Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan
2014 A* conf
Solving Optimization Problems with Diseconomies of Scale via Decoupling.
FOCS
Konstantin Makarychev, Maxim Sviridenko
2014 A conf
Stochastic Scheduling on Unrelated Machines.
STACS
Martin Skutella, Maxim Sviridenko, Marc Uetz
2014 A conf
Submodular Stochastic Probing on Matroids.
STACS
Marek Adamczyk, Maxim Sviridenko, Justin Ward
2013 J jnl
A Harmonic Algorithm for the 3D Strip Packing Problem.
SIAM J. Comput.
Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang
2013 B conf
An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem.
IPCO
Tim Nonner, Maxim Sviridenko
2013 B conf
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines.
IPCO
Maxim Sviridenko, Andreas Wiese
2013 — conf
Approximation Algorithms for the Joint Replenishment Problem with Deadlines.
ICALP (1)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young
2013 — conf
Energy Efficient Scheduling and Routing via Randomized Rounding.
FSTTCS
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko
2013 J jnl
Large Neighborhood Local Search for the Maximum Set Packing Problem
CoRR
Maxim Sviridenko, Justin Ward
2013 — conf
Large Neighborhood Local Search for the Maximum Set Packing Problem.
ICALP (1)
Maxim Sviridenko, Justin Ward
2013 J jnl
Matroid Matching: The Power of Local Search.
SIAM J. Comput.
Jon Lee, Maxim Sviridenko, Jan Vondrák
2013 — conf
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem.
ICALP (1)
Marcin Mucha, Maxim Sviridenko
2013 J jnl
No-Wait Flowshop Scheduling is as Hard as Asymmetric Traveling Salesman Problem
CoRR
Marcin Mucha, Maxim Sviridenko
2013 J jnl
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms.
Oper. Res.
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko
2013 J jnl
Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling.
CoRR
Sungjin Im, Maxim Sviridenko
2013 J jnl
Submodular Stochastic Probing on Matroids.
CoRR
Marek Adamczyk, Maxim Sviridenko, Justin Ward
2013 J jnl
Supermodularity and Affine Policies in Dynamic Robust Optimization.
Oper. Res.
Dan Andrei Iancu, Mayank Sharma, Maxim Sviridenko
2013 J jnl
Tight Bounds for Submodular and Supermodular Optimization with Bounded Curvature.
CoRR
Maxim Sviridenko, Justin Ward
2012 J jnl
A Complete 4-parametric complexity classification of short shop scheduling problems.
J. Sched.
Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko
2012 J jnl
A note on the Kenyon-Remila strip-packing algorithm.
Inf. Process. Lett.
Maxim Sviridenko
2012 A* conf
Concentration and moment inequalities for polynomials of independent random variables.
SODA
Warren Schudy, Maxim Sviridenko
2012 A* conf
Concentration inequalities for nonlinear matroid intersection.
SODA
Konstantin Makarychev, Warren Schudy, Maxim Sviridenko
2012 J jnl
Discretization orders for distance geometry problems.
Optim. Lett.
Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko
2012 A* conf
Inapproximability of the multi-level uncapacitated facility location problem.
SODA
Ravishankar Krishnaswamy, Maxim Sviridenko
2012 J jnl
Integer preemptive scheduling on parallel machines.
Oper. Res. Lett.
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
2012 — conf
New and Improved Bounds for the Minimum Set Cover Problem.
APPROX-RANDOM
Rishi Saket, Maxim Sviridenko
2012 A conf
Preemptive and Non-Preemptive Generalized Min Sum Set Cover.
STACS
Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan
2011 J jnl
Concentration and Moment Inequalities for Polynomials of Independent Random Variables
CoRR
Warren Schudy, Maxim Sviridenko
2011 — conf
Maximizing Polynomials Subject to Assignment Constraints.
ICALP (1)
Konstantin Makarychev, Maxim Sviridenko
2011 J jnl
Properties of optimal schedules in preemptive shop scheduling.
Discret. Appl. Math.
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
2011 J jnl
Sum edge coloring of multigraphs via configuration LP.
ACM Trans. Algorithms
Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko
2011 J jnl
Tight Approximation Algorithms for Maximum Separable Assignment Problems.
Math. Oper. Res.
Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
2010 J jnl
Dynamic pricing for impatient bidders.
ACM Trans. Algorithms
Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
2010 A* conf
Matroid matching: the power of local search.
STOC
Jon Lee, Maxim Sviridenko, Jan Vondrák
2010 J jnl
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints.
SIAM J. Discret. Math.
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
2010 — conf
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm.
ICALP (1)
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
2010 J jnl
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.
Math. Oper. Res.
Jon Lee, Maxim Sviridenko, Jan Vondrák
2009 J jnl
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing.
SIAM J. Comput.
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
2009 B conf
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability.
ISAAC
Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko
2009 J jnl
Approximating the minimum quadratic assignment problems.
ACM Trans. Algorithms
Refael Hassin, Asaf Levin, Maxim Sviridenko
2009 Misc conf
Complete Complexity Classification of Short Shop Scheduling.
CSR
Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko
2009 J jnl
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems.
Oper. Res. Lett.
Markus Bläser, L. Shankar Ram, Maxim Sviridenko
2009 Misc conf
Integrality Property in Preemptive Parallel Machine Scheduling.
CSR
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
2009 J jnl
Non-monotone submodular maximization under matroid and knapsack constraints
CoRR
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
2009 A* conf
Non-monotone submodular maximization under matroid and knapsack constraints.
STOC
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
2009 — conf
On Hardness of Pricing Items for Single-Minded Bidders.
APPROX-RANDOM
Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko
2009 J jnl
On the Maximum Quadratic Assignment Problem.
Math. Oper. Res.
Viswanath Nagarajan, Maxim Sviridenko
2009 A* conf
On the maximum quadratic assignment problem.
SODA
Viswanath Nagarajan, Maxim Sviridenko
2009 J jnl
Special Section On The Thirty-Ninth Annual ACM Symposium On Theory Of Computing (STOC 2007).
SIAM J. Comput.
Eric Allender, Vladlen Koltun, Maxim Sviridenko
2009 — conf
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.
APPROX-RANDOM
Jon Lee, Maxim Sviridenko, Jan Vondrák
2009 J jnl
Tight Bounds for Permutation Flow Shop Scheduling.
Math. Oper. Res.
Viswanath Nagarajan, Maxim Sviridenko
2008 J jnl
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem.
Manag. Sci.
Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko
2008 J jnl
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.
ACM Trans. Algorithms
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko
2008 J jnl
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities.
Math. Oper. Res.
Retsef Levi, Andrea Lodi, Maxim Sviridenko
2008 J jnl
High-multiplicity cyclic job shop scheduling.
Oper. Res. Lett.
Tracy Kimbrel, Maxim Sviridenko
2008 J jnl
Improved Approximation Algorithms for Broadcast Scheduling.
SIAM J. Comput.
Nikhil Bansal, Don Coppersmith, Maxim Sviridenko
2008 B conf
Min Sum Edge Coloring in Multigraphs Via Configuration LP.
IPCO
Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko
2008 — ch.
Minimum Makespan on Unrelated Machines.
Encyclopedia of Algorithms
Maxim Sviridenko
2008 A* conf
Online make-to-order joint replenishment model: primal dual competitive algorithms.
SODA
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko
2008 J jnl
Optimal bundle pricing with monotonicity constraint.
Oper. Res. Lett.
Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld
2008 B conf
Tight Bounds for Permutation Flow Shop Scheduling.
IPCO
Viswanath Nagarajan, Maxim Sviridenko
2007 B conf
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.
IPCO
Retsef Levi, Andrea Lodi, Maxim Sviridenko
2007 A conf
Bundle Pricing with Comparable Items.
ESA
Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld
2007 A* conf
Dynamic pricing for impatient bidders.
SODA
Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
2007 A* conf
Harmonic algorithm for 3-dimensional strip packing problem.
SODA
Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang
2007 J jnl
Inventory allocation and transportation scheduling for logistics of network-centric military operations.
IBM J. Res. Dev.
Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz
2007 J jnl
Machine scheduling with resource dependent processing times.
Math. Program.
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
2007 C conf
Optimal bundle pricing for homogeneous items.
CTW
Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld
2007 — conf
Test Machine Scheduling and Optimization for z/ OS.
CISched
Matthew Kaplan, Tracy Kimbrel, Kevin Mckenzie, Richard Prewitt, Maxim Sviridenko, Clay Williams, Cemal Yilmaz
2007 J jnl
Two-dimensional bin packing with one-dimensional resource augmentation.
Discret. Optim.
Nikhil Bansal, Maxim Sviridenko
2006 J jnl
Approximation algorithms for shop scheduling problems with minsum objective: A correction.
J. Sched.
Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan
2006 J jnl
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes.
Math. Oper. Res.
Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko
2006 A* conf
Dynamic placement for clustered web applications.
WWW
Alexei A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike Spreitzer, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi
2006 — conf
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem.
APPROX-RANDOM
Retsef Levi, Maxim Sviridenko
2006 A* conf
Improved approximation algorithms for broadcast scheduling.
SODA
Nikhil Bansal, Don Coppersmith, Maxim Sviridenko
2006 A* conf
Improved approximation algorithms for multidimensional bin packing problems.
FOCS
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
2006 J jnl
Job Shop Scheduling with Unit Processing Times.
Math. Oper. Res.
Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko
2006 — conf
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times.
APPROX-RANDOM
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
2006 J jnl
Minimizing migrations in fair multiprocessor scheduling of persistent tasks.
J. Sched.
Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko
2006 A* conf
The Santa Claus problem.
STOC
Nikhil Bansal, Maxim Sviridenko
2006 A* conf
Tight approximation algorithms for maximum general assignment problems.
SODA
Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
2005 A* conf
A Tale of Two Dimensional Bin Packing.
FOCS
Nikhil Bansal, Andrea Lodi, Maxim Sviridenko
2005 J jnl
An improved upper bound for the TSP in cubic 3-edge-connected graphs.
Oper. Res. Lett.
David Gamarnik, Moshe Lewenstein, Maxim Sviridenko
2005 J jnl
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
J. ACM
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
2005 — conf
Dynamic Application Placement Under Service and Memory Constraints.
WEA
Tracy Kimbrel, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi
2005 J jnl
Hamiltonian completions of sparse random graphs.
Discret. Appl. Math.
David Gamarnik, Maxim Sviridenko
2005 B conf
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems.
WADS
Markus Bläser, L. Shankar Ram, Maxim Sviridenko
2005 A* conf
Job shop scheduling with unit processing times.
SODA
Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko
2005 J jnl
Minimizing Makespan in No-Wait Job Shops.
Math. Oper. Res.
Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko
2005 B conf
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times.
IPCO
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
2004 J jnl
A Note on Permutation Flow Shop Problem.
Ann. Oper. Res.
Maxim Sviridenko
2004 J jnl
A note on maximizing a submodular set function subject to a knapsack constraint.
Oper. Res. Lett.
Maxim Sviridenko
2004 J jnl
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Algorithmica
Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
2004 J jnl
Buffer Overflow Management in QoS Switches.
SIAM J. Comput.
Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
2004 A* conf
Further Improvements in Competitive Guarantees for QoS Buffering.
ICALP
Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko
2004 A* conf
Minimizing migrations in fair multiprocessor scheduling of persistent tasks.
SODA
Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko
2004 A* conf
New approximability and inapproximability results for 2-dimensional Bin Packing.
SODA
Nikhil Bansal, Maxim Sviridenko
2004 J jnl
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee.
J. Comb. Optim.
Alexander A. Ageev, Maxim Sviridenko
2003 J jnl
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP.
SIAM J. Discret. Math.
Moshe Lewenstein, Maxim Sviridenko
2003 A* conf
Approximating asymmetric maximum TSP.
SODA
Moshe Lewenstein, Maxim Sviridenko
2003 A* conf
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.
FOCS
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
2003 J jnl
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme.
SIAM J. Discret. Math.
Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
2003 J jnl
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme.
SIAM J. Discret. Math.
Maxim Sviridenko
2002 J jnl
A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective.
J. Algorithms
Maurice Queyranne, Maxim Sviridenko
2002 J jnl
A linear time approximation scheme for makespan minimization in an open shop with release dates.
Oper. Res. Lett.
Alexander V. Kononov, Maxim Sviridenko
2002 B conf
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.
IPCO
Maxim Sviridenko
2002 — conf
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
SWAT
Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
2002 A* conf
The diameter of a long range percolation graph.
SODA
Don Coppersmith, David Gamarnik, Maxim Sviridenko
2002 J jnl
The diameter of a long-range percolation graph.
Random Struct. Algorithms
Don Coppersmith, David Gamarnik, Maxim Sviridenko
2001 B conf
A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective.
IPCO
Maurice Queyranne, Maxim Sviridenko
2001 J jnl
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.
SIAM J. Discret. Math.
Alexander A. Ageev, Refael Hassin, Maxim Sviridenko
2001 J jnl
Approximating the maximum quadratic assignment problem.
Inf. Process. Lett.
Esther M. Arkin, Refael Hassin, Maxim Sviridenko
2001 J jnl
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint.
Algorithmica
Maxim Sviridenko
2001 A* conf
Buffer overflow management in QoS switches.
STOC
Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
2001 A* conf
Online server allocation in a server farm via benefit task systems.
STOC
T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko
2000 A conf
An Approximation Algorithm for Hypergraph Max
ESA
Alexander A. Ageev, Maxim Sviridenko
2000 — conf
An approximation algorithm for MAX DICUT with given sizes of parts.
APPROX
Alexander A. Ageev, Refael Hassin, Maxim Sviridenko
2000 A* conf
Approximability and in-approximability results for no-wait shop scheduling.
FOCS
Maxim Sviridenko, Gerhard J. Woeginger
2000 A* conf
New and improved algorithms for minsum shop scheduling.
SODA
Maurice Queyranne, Maxim Sviridenko
2000 A conf
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.
STACS
Klaus Jansen, Maxim Sviridenko
2000 J jnl
Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem.
Oper. Res. Lett.
Maxim Sviridenko
1999 — conf
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.
RANDOM-APPROX
Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
1999 J jnl
An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem.
Discret. Appl. Math.
Alexander A. Ageev, Maxim Sviridenko
1999 B conf
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.
IPCO
Alexander A. Ageev, Maxim Sviridenko
1999 A* conf
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
FOCS
Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko
1999 A* conf
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme.
STOC
Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
1998 — conf
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint.
APPROX
Maxim Sviridenko