Maxim Sviridenko

According to our database, Maxim Sviridenko authored at least 131 papers between 1999 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Gradient Descent Converges Linearly for Logistic Regression on Separable Data.

Kyriakos Axiotis, Maxim Sviridenko

Proceedings of the International Conference on Machine Learning, 2023

2022

Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime.

Kyriakos Axiotis, Maxim Sviridenko

Proceedings of the International Conference on Machine Learning, 2022

2021

Sparse Convex Optimization via Adaptively Regularized Hard Thresholding.

Kyriakos Axiotis, Maxim Sviridenko

J. Mach. Learn. Res., 2021

VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search.

Shaunak Mishra, Mikhail Kuznetsov, Gaurav Srivastava, Maxim Sviridenko

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Local Search Algorithms for Rank-Constrained Convex Optimization.

Kyriakos Axiotis, Maxim Sviridenko

Proceedings of the 9th International Conference on Learning Representations, 2021

TSI: An Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity.

Shaunak Mishra, Changwei Hu, Manisha Verma, Kevin Yen, Yifan Hu, Maxim Sviridenko

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2019

On the computational complexity of the probabilistic label tree algorithms.

Róbert Busa-Fekete, Krzysztof Dembczynski, Alexander Golovnev, Kalina Jasinska, Mikhail Kuznetsov, Maxim Sviridenko, Chao Xu

CoRR, 2019

Submodular Optimization with Contention Resolution Extensions.

Benjamin Moseley, Maxim Sviridenko

Proceedings of the Approximation, 2019

2018

Energy-efficient scheduling and routing via randomized rounding.

Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko

J. Sched., 2018

Solving Optimization Problems with Diseconomies of Scale via Decoupling.

Konstantin Makarychev, Maxim Sviridenko

J. ACM, 2018

Integrated Supply Chain Management via Randomized Rounding.

Lehilton L. C. Pedrosa, Maxim Sviridenko

INFORMS J. Comput., 2018

Matching Auctions for Search and Native Ads.

Ruggiero Cavallo, Maxim Sviridenko, Christopher A. Wilkens

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017

Maximizing Polynomials Subject to Assignment Constraints.

Konstantin Makarychev, Maxim Sviridenko

ACM Trans. Algorithms, 2017

Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature.

Maxim Sviridenko, Jan Vondrák, Justin Ward

Math. Oper. Res., 2017

Sponsored Search Auctions with Rich Ads.

Ruggiero Cavallo, Prabhakar Krishnamurthy, Maxim Sviridenko, Christopher A. Wilkens

Proceedings of the 26th International Conference on World Wide Web, 2017

Greedy Minimization of Weakly Supermodular Set Functions.

Edo Liberty, Maxim Sviridenko

Proceedings of the Approximation, 2017

Determining Tournament Payout Structures for Daily Fantasy Sports.

Christopher Musco, Maxim Sviridenko, Justin Thaler

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016

Inapproximability of the Multilevel Uncapacitated Facility Location Problem.

Ravishankar Krishnaswamy, Maxim Sviridenko

ACM Trans. Algorithms, 2016

Unrelated Machine Scheduling with Stochastic Processing Times.

Martin Skutella, Maxim Sviridenko, Marc Uetz

Math. Oper. Res., 2016

No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem.

Marcin Mucha, Maxim Sviridenko

Math. Oper. Res., 2016

Submodular Stochastic Probing on Matroids.

Marek Adamczyk, Maxim Sviridenko, Justin Ward

Math. Oper. Res., 2016

Polynomial-Time Approximation Schemes for Circle and Other Packing Problems.

Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi

Algorithmica, 2016

Bidding Strategies for Fantasy-Sports Auctions.

Aris Anagnostopoulos, Ruggiero Cavallo, Stefano Leonardi, Maxim Sviridenko

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

A Bi-Criteria Approximation Algorithm for k-Means.

Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward

Proceedings of the Approximation, 2016

An Algorithm for Online K-Means Clustering.

Edo Liberty, Ram Sriharsha, Maxim Sviridenko

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

Approximation algorithms for the joint replenishment problem with deadlines.

Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young

J. Sched., 2015

Concentration inequalities for nonlinear matroid intersection.

Konstantin Makarychev, Warren Schudy, Maxim Sviridenko

Random Struct. Algorithms, 2015

Greedy Minimization of Weakly Supermodular Set Functions.

Christos Boutsidis, Edo Liberty, Maxim Sviridenko

CoRR, 2015

New Approximations for Broadcast Scheduling via Variants of α-point Rounding.

Sungjin Im, Maxim Sviridenko

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm.

Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko

ACM Trans. Algorithms, 2014

Preemptive and non-preemptive generalized min sum set cover.

Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan

Math. Program., 2014

Optimization Problems with Diseconomies of Scale via Decoupling.

Konstantin Makarychev, Maxim Sviridenko

CoRR, 2014

Stochastic Scheduling on Unrelated Machines.

Martin Skutella, Maxim Sviridenko, Marc Uetz

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Polynomial-Time Approximation Schemes for Circle Packing Problems.

Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi

Proceedings of the Algorithms - ESA 2014, 2014

2013

Matroid Matching: The Power of Local Search.

Jon Lee, Maxim Sviridenko, Jan Vondrák

SIAM J. Comput., 2013

A Harmonic Algorithm for the 3D Strip Packing Problem.

Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang

SIAM J. Comput., 2013

Supermodularity and Affine Policies in Dynamic Robust Optimization.

Dan Andrei Iancu, Mayank Sharma, Maxim Sviridenko

Oper. Res., 2013

Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms.

Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko

Oper. Res., 2013

Tight Bounds for Submodular and Supermodular Optimization with Bounded Curvature.

Maxim Sviridenko, Justin Ward

CoRR, 2013

Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling.

Sungjin Im, Maxim Sviridenko

CoRR, 2013

Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines.

Maxim Sviridenko, Andreas Wiese

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem.

Tim Nonner, Maxim Sviridenko

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Large Neighborhood Local Search for the Maximum Set Packing Problem.

Maxim Sviridenko, Justin Ward

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

A Complete 4-parametric complexity classification of short shop scheduling problems.

Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko

J. Sched., 2012

Integer preemptive scheduling on parallel machines.

Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko

Oper. Res. Lett., 2012

Discretization orders for distance geometry problems.

Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko

Optim. Lett., 2012

A note on the Kenyon-Remila strip-packing algorithm.

Maxim Sviridenko

Inf. Process. Lett., 2012

Concentration and moment inequalities for polynomials of independent random variables.

Warren Schudy, Maxim Sviridenko

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Inapproximability of the multi-level uncapacitated facility location problem.

Ravishankar Krishnaswamy, Maxim Sviridenko

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

New and Improved Bounds for the Minimum Set Cover Problem.

Rishi Saket, Maxim Sviridenko

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Sum edge coloring of multigraphs via configuration LP.

Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko

ACM Trans. Algorithms, 2011

Tight Approximation Algorithms for Maximum Separable Assignment Problems.

Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko

Math. Oper. Res., 2011

Properties of optimal schedules in preemptive shop scheduling.

Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko

Discret. Appl. Math., 2011

2010

Dynamic pricing for impatient bidders.

Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko

ACM Trans. Algorithms, 2010

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints.

Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko

SIAM J. Discret. Math., 2010

Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.

Jon Lee, Maxim Sviridenko, Jan Vondrák

Math. Oper. Res., 2010

2009

Approximating the minimum quadratic assignment problems.

Refael Hassin, Asaf Levin, Maxim Sviridenko

ACM Trans. Algorithms, 2009

A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing.

Nikhil Bansal, Alberto Caprara, Maxim Sviridenko

SIAM J. Comput., 2009

Special Section On The Thirty-Ninth Annual ACM Symposium On Theory Of Computing (STOC 2007).

Eric Allender, Vladlen Koltun, Maxim Sviridenko

SIAM J. Comput., 2009

Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems.

Markus Bläser, L. Shankar Ram, Maxim Sviridenko

Oper. Res. Lett., 2009

On the Maximum Quadratic Assignment Problem.

Viswanath Nagarajan, Maxim Sviridenko

Math. Oper. Res., 2009

Tight Bounds for Permutation Flow Shop Scheduling.

Viswanath Nagarajan, Maxim Sviridenko

Math. Oper. Res., 2009

Non-monotone submodular maximization under matroid and knapsack constraints.

Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability.

Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Complete Complexity Classification of Short Shop Scheduling.

Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko

Proceedings of the Computer Science, 2009

Integrality Property in Preemptive Parallel Machine Scheduling.

Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko

Proceedings of the Computer Science, 2009

On Hardness of Pricing Items for Single-Minded Bidders.

Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko

Proceedings of the Approximation, 2009

2008

Minimum Makespan on Unrelated Machines.

Maxim Sviridenko

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.

Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko

ACM Trans. Algorithms, 2008

Improved Approximation Algorithms for Broadcast Scheduling.

Nikhil Bansal, Don Coppersmith, Maxim Sviridenko

SIAM J. Comput., 2008

High-multiplicity cyclic job shop scheduling.

Tracy Kimbrel, Maxim Sviridenko

Oper. Res. Lett., 2008

Optimal bundle pricing with monotonicity constraint.

Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld

Oper. Res. Lett., 2008

Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities.

Retsef Levi, Andrea Lodi, Maxim Sviridenko

Math. Oper. Res., 2008

A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem.

Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko

Manag. Sci., 2008

Min Sum Edge Coloring in Multigraphs Via Configuration LP.

Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

Machine scheduling with resource dependent processing times.

Alexander Grigoriev, Maxim Sviridenko, Marc Uetz

Math. Program., 2007

Inventory allocation and transportation scheduling for logistics of network-centric military operations.

Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz

IBM J. Res. Dev., 2007

Two-dimensional bin packing with one-dimensional resource augmentation.

Nikhil Bansal, Maxim Sviridenko

Discret. Optim., 2007

Harmonic algorithm for 3-dimensional strip packing problem.

Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.

Retsef Levi, Andrea Lodi, Maxim Sviridenko

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Bundle Pricing with Comparable Items.

Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld

Proceedings of the Algorithms, 2007

Optimal bundle pricing for homogeneous items.

Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

Test Machine Scheduling and Optimization for z/ OS.

Matthew Kaplan, Tracy Kimbrel, Kevin Mckenzie, Richard Prewitt, Maxim Sviridenko, Clay Williams, Cemal Yilmaz

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

2006

Approximation algorithms for shop scheduling problems with minsum objective: A correction.

Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan

J. Sched., 2006

Minimizing migrations in fair multiprocessor scheduling of persistent tasks.

Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko

J. Sched., 2006

Job Shop Scheduling with Unit Processing Times.

Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko

Math. Oper. Res., 2006

Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes.

Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko

Math. Oper. Res., 2006

Dynamic placement for clustered web applications.

Alexei A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike Spreitzer, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi

Proceedings of the 15th international conference on World Wide Web, 2006

The Santa Claus problem.

Nikhil Bansal, Maxim Sviridenko

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Tight approximation algorithms for maximum general assignment problems.

Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Improved approximation algorithms for multidimensional bin packing problems.

Nikhil Bansal, Alberto Caprara, Maxim Sviridenko

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem.

Retsef Levi, Maxim Sviridenko

Proceedings of the Approximation, 2006

LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times.

Alexander Grigoriev, Maxim Sviridenko, Marc Uetz

Proceedings of the Approximation, 2006

2005

An improved upper bound for the TSP in cubic 3-edge-connected graphs.

David Gamarnik, Moshe Lewenstein, Maxim Sviridenko

Oper. Res. Lett., 2005

Minimizing Makespan in No-Wait Job Shops.

Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko

Math. Oper. Res., 2005

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.

Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko

J. ACM, 2005

Hamiltonian completions of sparse random graphs.

David Gamarnik, Maxim Sviridenko

Discret. Appl. Math., 2005

Dynamic Application Placement Under Service and Memory Constraints.

Tracy Kimbrel, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times.

Alexander Grigoriev, Maxim Sviridenko, Marc Uetz

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

A Tale of Two Dimensional Bin Packing.

Nikhil Bansal, Andrea Lodi, Maxim Sviridenko

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Buffer Overflow Management in QoS Switches.

Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko

SIAM J. Comput., 2004

A note on maximizing a submodular set function subject to a knapsack constraint.

Maxim Sviridenko

Oper. Res. Lett., 2004

Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee.

Alexander A. Ageev, Maxim Sviridenko

J. Comb. Optim., 2004

A Note on Permutation Flow Shop Problem.

Maxim Sviridenko

Ann. Oper. Res., 2004

Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.

Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko

Algorithmica, 2004

New approximability and inapproximability results for 2-dimensional Bin Packing.

Nikhil Bansal, Maxim Sviridenko

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Further Improvements in Competitive Guarantees for QoS Buffering.

Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme.

Maxim Sviridenko

SIAM J. Discret. Math., 2003

A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP.

Moshe Lewenstein, Maxim Sviridenko

SIAM J. Discret. Math., 2003

Makespan Minimization in Job Shops: A Linear Time Approximation Scheme.

Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko

SIAM J. Discret. Math., 2003

Approximating asymmetric maximum TSP.

Moshe Lewenstein, Maxim Sviridenko

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

The diameter of a long-range percolation graph.

Don Coppersmith, David Gamarnik, Maxim Sviridenko

Random Struct. Algorithms, 2002

A linear time approximation scheme for makespan minimization in an open shop with release dates.

Alexander V. Kononov, Maxim Sviridenko

Oper. Res. Lett., 2002

A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective.

Maurice Queyranne, Maxim Sviridenko

J. Algorithms, 2002

Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.

Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko

Proceedings of the Algorithm Theory, 2002

An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.

Maxim Sviridenko

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.

Alexander A. Ageev, Refael Hassin, Maxim Sviridenko

SIAM J. Discret. Math., 2001

Approximating the maximum quadratic assignment problem.

Esther M. Arkin, Refael Hassin, Maxim Sviridenko

Inf. Process. Lett., 2001

Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint.

Maxim Sviridenko

Algorithmica, 2001

Online server allocation in a server farm via benefit task systems.

T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000

Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem.

Maxim Sviridenko

Oper. Res. Lett., 2000

Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.

Klaus Jansen, Maxim Sviridenko

Proceedings of the STACS 2000, 2000

New and improved algorithms for minsum shop scheduling.

Maurice Queyranne, Maxim Sviridenko

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Approximability and in-approximability results for no-wait shop scheduling.

Maxim Sviridenko, Gerhard J. Woeginger

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

An Approximation Algorithm for Hypergraph Max <i>k</i>-Cut with Given Sizes of Parts.

Alexander A. Ageev, Maxim Sviridenko

Proceedings of the Algorithms, 2000

An approximation algorithm for MAX DICUT with given sizes of parts.

Alexander A. Ageev, Refael Hassin, Maxim Sviridenko

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem.

Alexander A. Ageev, Maxim Sviridenko

Discret. Appl. Math., 1999

Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme.

Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.

Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko

Proceedings of the Randomization, 1999

Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.

Alexander A. Ageev, Maxim Sviridenko

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.

Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999