Maxim Sviridenko

Jon Lee, Maxim Sviridenko, Jan Vondrák: Matroid Matching: The Power of Local Search. SIAM J. Comput. 42(1): 357-379 (2013)

Tim Nonner, Maxim Sviridenko: An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem. IPCO 2013: 314-323

Maxim Sviridenko, Andreas Wiese: Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. IPCO 2013: 387-398

Marcin Mucha, Maxim Sviridenko: No-Wait Flowshop Scheduling is as Hard as Asymmetric Traveling Salesman Problem. CoRR abs/1302.2551 (2013)

Maxim Sviridenko, Justin Ward: Large Neighborhood Local Search for the Maximum Set Packing Problem. CoRR abs/1302.4347 (2013)

Maxim Sviridenko: A note on the Kenyon-Remila strip-packing algorithm. Inf. Process. Lett. 112(1-2): 10-12 (2012)

Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko: Discretization orders for distance geometry problems. Optimization Letters 6(4): 783-796 (2012)

Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012)

Alexander Kononov, Sergey Sevastyanov, Maxim Sviridenko: A Complete 4-parametric complexity classification of short shop scheduling problems. J. Scheduling 15(4): 427-446 (2012)

Rishi Saket, Maxim Sviridenko: New and Improved Bounds for the Minimum Set Cover Problem. APPROX-RANDOM 2012: 288-300

Konstantin Makarychev, Warren Schudy, Maxim Sviridenko: Concentration inequalities for nonlinear matroid intersection. SODA 2012: 420-436

Warren Schudy, Maxim Sviridenko: Concentration and moment inequalities for polynomials of independent random variables. SODA 2012: 437-446

Ravishankar Krishnaswamy, Maxim Sviridenko: Inapproximability of the multi-level uncapacitated facility location problem. SODA 2012: 718-734

Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan: Preemptive and Non-Preemptive Generalized Min Sum Set Cover. STACS 2012: 465-476

Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Properties of optimal schedules in preemptive shop scheduling. Discrete Applied Mathematics 159(5): 272-280 (2011)

Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko: Tight Approximation Algorithms for Maximum Separable Assignment Problems. Math. Oper. Res. 36(3): 416-431 (2011)

Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko: Sum edge coloring of multigraphs via configuration LP. ACM Transactions on Algorithms 7(2): 22 (2011)

Konstantin Makarychev, Maxim Sviridenko: Maximizing Polynomials Subject to Assignment Constraints. ICALP (1) 2011: 510-520

Warren Schudy, Maxim Sviridenko: Concentration and Moment Inequalities for Polynomials of Independent Random Variables. CoRR abs/1104.4997 (2011)

Jon Lee, Maxim Sviridenko, Jan Vondrák: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. Math. Oper. Res. 35(4): 795-806 (2010)

Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. SIAM J. Discrete Math. 23(4): 2053-2078 (2010)

Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko: Dynamic pricing for impatient bidders. ACM Transactions on 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: 594-604

Jon Lee, Maxim Sviridenko, Jan Vondrák: Matroid matching: the power of local search. STOC 2010: 369-378

Viswanath Nagarajan, Maxim Sviridenko: Tight Bounds for Permutation Flow Shop Scheduling. Math. Oper. Res. 34(2): 417-427 (2009)

Viswanath Nagarajan, Maxim Sviridenko: On the Maximum Quadratic Assignment Problem. Math. Oper. Res. 34(4): 859-868 (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): 176-180 (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): 978 (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): 1256-1278 (2009)

Refael Hassin, Asaf Levin, Maxim Sviridenko: Approximating the minimum quadratic assignment problems. ACM Transactions on Algorithms 6(1) (2009)

Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko: On Hardness of Pricing Items for Single-Minded Bidders. APPROX-RANDOM 2009: 202-216

Jon Lee, Maxim Sviridenko, Jan Vondrák: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. APPROX-RANDOM 2009: 244-257

Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46

Alexander Kononov, Sergey Sevastyanov, Maxim Sviridenko: Complete Complexity Classification of Short Shop Scheduling. CSR 2009: 227-236

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: 77-86

Viswanath Nagarajan, Maxim Sviridenko: On the maximum quadratic assignment problem. SODA 2009: 516-524

Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Non-monotone submodular maximization under matroid and knapsack constraints. STOC 2009: 323-332

Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Non-monotone submodular maximization under matroid and knapsack constraints. CoRR abs/0902.0353 (2009)

Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko: A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. Management Science 54(4): 763-776 (2008)

Retsef Levi, Andrea Lodi, Maxim Sviridenko: Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities. Math. Oper. Res. 33(2): 461-474 (2008)

Tracy Kimbrel, Maxim Sviridenko: High-multiplicity cyclic job shop scheduling. Oper. Res. Lett. 36(5): 574-578 (2008)

Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld: Optimal bundle pricing with monotonicity constraint. Oper. Res. Lett. 36(5): 609-614 (2008)

Nikhil Bansal, Don Coppersmith, Maxim Sviridenko: Improved Approximation Algorithms for Broadcast Scheduling. SIAM J. Comput. 38(3): 1157-1174 (2008)

Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Transactions on Algorithms 4(3) (2008)

Viswanath Nagarajan, Maxim Sviridenko: Tight Bounds for Permutation Flow Shop Scheduling. IPCO 2008: 154-168

Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko: Min Sum Edge Coloring in Multigraphs Via Configuration LP. IPCO 2008: 359-373

Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko: Online make-to-order joint replenishment model: primal dual competitive algorithms. SODA 2008: 952-961

Maxim Sviridenko: Minimum Makespan on Unrelated Machines. Encyclopedia of Algorithms 2008

Nikhil Bansal, Maxim Sviridenko: Two-dimensional bin packing with one-dimensional resource augmentation. Discrete Optimization 4(2): 143-153 (2007)

Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz: Inventory allocation and transportation scheduling for logistics of network-centric military operations. IBM Journal of Research and Development 51(3/4): 391-408 (2007)

Alexander Grigoriev, Maxim Sviridenko, Marc Uetz: Machine scheduling with resource dependent processing times. Math. Program. 110(1): 209-228 (2007)

Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld: Optimal bundle pricing for homogeneous items. CTW 2007: 57-60

Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld: Bundle Pricing with Comparable Items. ESA 2007: 475-486

Retsef Levi, Andrea Lodi, Maxim Sviridenko: Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. IPCO 2007: 454-468

Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko: Dynamic pricing for impatient bidders. SODA 2007: 726-735

Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang: Harmonic algorithm for 3-dimensional strip packing problem. SODA 2007: 1197-1206

Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. Math. Oper. Res. 31(1): 31-49 (2006)

Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko: Job Shop Scheduling with Unit Processing Times. Math. Oper. Res. 31(2): 381-389 (2006)

Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko: Minimizing migrations in fair multiprocessor scheduling of persistent tasks. J. Scheduling 9(4): 365-379 (2006)

Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan: Approximation algorithms for shop scheduling problems with minsum objective: A correction. J. Scheduling 9(6): 569-570 (2006)

Alexander Grigoriev, Maxim Sviridenko, Marc Uetz: LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times. APPROX-RANDOM 2006: 140-151

Retsef Levi, Maxim Sviridenko: Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem. APPROX-RANDOM 2006: 188-199

Nikhil Bansal, Alberto Caprara, Maxim Sviridenko: Improved approximation algorithms for multidimensional bin packing problems. FOCS 2006: 697-708

Nikhil Bansal, Don Coppersmith, Maxim Sviridenko: Improved approximation algorithms for broadcast scheduling. SODA 2006: 344-353

Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko: Tight approximation algorithms for maximum general assignment problems. SODA 2006: 611-620

Nikhil Bansal, Maxim Sviridenko: The Santa Claus problem. STOC 2006: 31-40

A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike Spreitzer, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi: Dynamic placement for clustered web applications. WWW 2006: 595-604

David Gamarnik, Maxim Sviridenko: Hamiltonian completions of sparse random graphs. Discrete Applied Mathematics 152(1-3): 139-158 (2005)

Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4): 602-626 (2005)

Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko: Minimizing Makespan in No-Wait Job Shops. Math. Oper. Res. 30(4): 817-831 (2005)

David Gamarnik, Moshe Lewenstein, Maxim Sviridenko: An improved upper bound for the TSP in cubic 3-edge-connected graphs. Oper. Res. Lett. 33(5): 467-474 (2005)

Nikhil Bansal, Andrea Lodi, Maxim Sviridenko: A Tale of Two Dimensional Bin Packing. FOCS 2005: 657-666

Alexander Grigoriev, Maxim Sviridenko, Marc Uetz: Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. IPCO 2005: 182-195

Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko: Job shop scheduling with unit processing times. SODA 2005: 207-214

Markus Bläser, L. Shankar Ram, Maxim Sviridenko: Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. WADS 2005: 350-359

Tracy Kimbrel, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi: Dynamic Application Placement Under Service and Memory Constraints. WEA 2005: 391-402

Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko: Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. Algorithmica 39(2): 175-187 (2004)

Maxim Sviridenko: A Note on Permutation Flow Shop Problem. Annals OR 129(1-4): 247-252 (2004)

Alexander A. Ageev, Maxim Sviridenko: Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. J. Comb. Optim. 8(3): 307-328 (2004)

Maxim Sviridenko: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1): 41-43 (2004)

Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko: Buffer Overflow Management in QoS Switches. SIAM J. Comput. 33(3): 563-583 (2004)

Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko: Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207

Nikhil Bansal, Maxim Sviridenko: New approximability and inapproximability results for 2-dimensional Bin Packing. SODA 2004: 196-203

Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko: Minimizing migrations in fair multiprocessor scheduling of persistent tasks. SODA 2004: 982-991

Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko: Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. SIAM J. Discrete Math. 16(2): 288-300 (2003)

Maxim Sviridenko: Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme. SIAM J. Discrete Math. 16(2): 313-322 (2003)

Moshe Lewenstein, Maxim Sviridenko: A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP. SIAM J. Discrete Math. 17(2): 237-248 (2003)

Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS 2003: 56-65

Moshe Lewenstein, Maxim Sviridenko: Approximating asymmetric maximum TSP. SODA 2003: 646-654

Maurice Queyranne, Maxim Sviridenko: A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. J. Algorithms 45(2): 202-212 (2002)

Alexander Kononov, Maxim Sviridenko: A linear time approximation scheme for makespan minimization in an open shop with release dates. Oper. Res. Lett. 30(4): 276-280 (2002)

Don Coppersmith, David Gamarnik, Maxim Sviridenko: The diameter of a long-range percolation graph. Random Struct. Algorithms 21(1): 1-13 (2002)

Maxim Sviridenko: An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. IPCO 2002: 240-257

Don Coppersmith, David Gamarnik, Maxim Sviridenko: The diameter of a long range percolation graph. SODA 2002: 329-337

Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko: Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. SWAT 2002: 280-287

Maxim Sviridenko: Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. Algorithmica 30(3): 398-405 (2001)

Esther M. Arkin, Refael Hassin, Maxim Sviridenko: Approximating the maximum quadratic assignment problem. Inf. Process. Lett. 77(1): 13-16 (2001)

Alexander A. Ageev, Refael Hassin, Maxim Sviridenko: A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. SIAM J. Discrete Math. 14(2): 246-255 (2001)

Maurice Queyranne, Maxim Sviridenko: A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. IPCO 2001: 361-369

Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko: Buffer overflow management in QoS switches. STOC 2001: 520-529

T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko: Online server allocation in a server farm via benefit task systems. STOC 2001: 540-549

Maxim Sviridenko: Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem. Oper. Res. Lett. 26(4): 193-197 (2000)

Alexander A. Ageev, Refael Hassin, Maxim Sviridenko: An approximation algorithm for MAX DICUT with given sizes of parts. APPROX 2000: 34-41

Alexander A. Ageev, Maxim Sviridenko: An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. ESA 2000: 32-41

Maxim Sviridenko, Gerhard J. Woeginger: Approximability and in-approximability results for no-wait shop scheduling. FOCS 2000: 116-125

Maurice Queyranne, Maxim Sviridenko: New and improved algorithms for minsum shop scheduling. SODA 2000: 871-878

Klaus Jansen, Maxim Sviridenko: Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. STACS 2000: 455-465

Alexander A. Ageev, Maxim Sviridenko: An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem. Discrete Applied Mathematics 93(2-3): 149-156 (1999)

Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44

Alexander A. Ageev, Maxim Sviridenko: Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. IPCO 1999: 17-30

Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko: A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. RANDOM-APPROX 1999: 177-188

Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko: Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. STOC 1999: 394-399

Maxim Sviridenko: Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. APPROX 1998: 193-199