M. I. Sviridenko

From MaRDI portal
Person:208494

Available identifiers

zbMath Open sviridenko.maxim-iMaRDI QIDQ208494

List of research outcomes

PublicationDate of PublicationType
Submodular Optimization with Contention Resolution Extensions.2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50026222021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q49990972021-07-09Paper
Integrated Supply Chain Management via Randomized Rounding2020-11-09Paper
An Algorithm for Online K-Means Clustering2019-09-12Paper
https://portal.mardi4nfdi.de/entity/Q57434092019-05-10Paper
Concentration and Moment Inequalities for Polynomials of Independent Random Variables2019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q57434322019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46338622019-05-06Paper
Solving Optimization Problems with Diseconomies of Scale via Decoupling2019-02-25Paper
Maximizing Polynomials Subject to Assignment Constraints2018-11-12Paper
Energy-efficient scheduling and routing via randomized rounding2018-11-07Paper
Inapproximability of the Multilevel Uncapacitated Facility Location Problem2018-11-05Paper
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs2018-11-05Paper
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm2018-10-30Paper
A Bi-Criteria Approximation Algorithm for k-Means2018-04-19Paper
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature2017-12-07Paper
New Approximations for Broadcast Scheduling via Variants of α-point Rounding2017-10-05Paper
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature2017-10-05Paper
Submodular Stochastic Probing on Matroids2017-03-03Paper
Stochastic Scheduling on Unrelated Machines2017-03-03Paper
https://portal.mardi4nfdi.de/entity/Q29639342017-02-21Paper
Bidding Strategies for Fantasy-Sports Auctions2017-02-10Paper
Polynomial-time approximation schemes for circle and other packing problems2016-10-21Paper
Makespan minimization in job shops2016-09-29Paper
Unrelated Machine Scheduling with Stochastic Processing Times2016-08-10Paper
Submodular Stochastic Probing on Matroids2016-08-10Paper
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem2016-04-15Paper
https://portal.mardi4nfdi.de/entity/Q55012592015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013612015-08-03Paper
Concentration inequalities for nonlinear matroid intersection2015-05-29Paper
Buffer overflow management in QoS switches2015-02-27Paper
Online server allocation in a server farm via benefit task systems2015-02-27Paper
Non-monotone submodular maximization under matroid and knapsack constraints2015-02-04Paper
https://portal.mardi4nfdi.de/entity/Q29346592014-12-18Paper
https://portal.mardi4nfdi.de/entity/Q29347152014-12-18Paper
The Santa Claus problem2014-11-25Paper
Approximating the minimum quadratic assignment problems2014-11-18Paper
Dynamic pricing for impatient bidders2014-11-18Paper
https://portal.mardi4nfdi.de/entity/Q29216722014-10-13Paper
Polynomial-Time Approximation Schemes for Circle Packing Problems2014-10-08Paper
Sum edge coloring of multigraphs via configuration LP2014-09-09Paper
Matroid matching2014-08-13Paper
Preemptive and non-preemptive generalized min sum set cover2014-06-27Paper
Supermodularity and Affine Policies in Dynamic Robust Optimization2014-06-26Paper
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms2014-06-26Paper
Optimization Problems with Diseconomies of Scale via Decoupling2014-04-11Paper
Integrated Supply Chain Management via Randomized Rounding2014-03-31Paper
A complete 4-parametric complexity classification of short shop scheduling problems2014-02-05Paper
Large Neighborhood Local Search for the Maximum Set Packing Problem2013-08-06Paper
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem2013-08-06Paper
A Harmonic Algorithm for the 3D Strip Packing Problem2013-07-24Paper
Matroid Matching: The Power of Local Search2013-07-04Paper
An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem2013-03-19Paper
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines2013-03-19Paper
Integer preemptive scheduling on parallel machines2013-03-05Paper
New and Improved Bounds for the Minimum Set Cover Problem2012-11-02Paper
Preemptive and non-preemptive generalized min sum set cover2012-08-23Paper
Tight Approximation Algorithms for Maximum Separable Assignment Problems2012-05-24Paper
A note on the Kenyon-Remila strip-packing algorithm2012-03-09Paper
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem2012-02-29Paper
https://portal.mardi4nfdi.de/entity/Q31157182012-02-10Paper
Bernstein-like Concentration and Moment Inequalities for Polynomials of Independent Random Variables: Multilinear Case2011-09-23Paper
Maximizing Polynomials Subject to Assignment Constraints2011-07-06Paper
Tight Bounds for Permutation Flow Shop Scheduling2011-04-27Paper
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties2011-04-27Paper
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities2011-04-27Paper
On the Maximum Quadratic Assignment Problem2011-04-27Paper
Properties of optimal schedules in preemptive shop scheduling2011-03-10Paper
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints2010-12-03Paper
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm2010-09-07Paper
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing2010-09-06Paper
Improved approximation algorithms for broadcast scheduling2010-08-16Paper
Tight approximation algorithms for maximum general assignment problems2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35793872010-08-06Paper
On the rate of convergence to the neutral attractor of a family of one-dimensional maps2010-04-09Paper
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability2009-12-17Paper
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties2009-10-28Paper
On Hardness of Pricing Items for Single-Minded Bidders2009-10-28Paper
Integrality Property in Preemptive Parallel Machine Scheduling2009-08-18Paper
Complete Complexity Classification of Short Shop Scheduling2009-08-18Paper
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems2009-08-14Paper
Improved Approximation Algorithms for Broadcast Scheduling2009-06-22Paper
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs2008-12-21Paper
High-multiplicity cyclic job shop scheduling2008-11-27Paper
Optimal bundle pricing with monotonicity constraint2008-11-27Paper
Bundle Pricing with Comparable Items2008-09-25Paper
Tight Bounds for Permutation Flow Shop Scheduling2008-06-10Paper
Min Sum Edge Coloring in Multigraphs Via Configuration LP2008-06-10Paper
Minimizing Makespan in No-Wait Job Shops2008-05-27Paper
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes2008-05-27Paper
Job Shop Scheduling with Unit Processing Times2008-05-27Paper
Two-dimensional bin packing with one-dimensional resource augmentation2008-01-18Paper
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities2007-11-29Paper
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times2007-08-30Paper
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem2007-08-28Paper
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times2007-08-28Paper
Minimizing migrations in fair multiprocessor scheduling of persistent tasks2007-05-15Paper
Approximation algorithms for shop scheduling problems with minsum objective: A correction2007-05-15Paper
Machine scheduling with resource dependent processing times2007-04-19Paper
Algorithms and Data Structures2006-10-25Paper
Hamiltonian completions of sparse random graphs2005-12-27Paper
Experimental and Efficient Algorithms2005-11-30Paper
An improved upper bound for the TSP in cubic 3-edge-connected graphs2005-08-25Paper
Automata, Languages and Programming2005-08-24Paper
Buffer Overflow Management in QoS Switches2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q48289512004-11-29Paper
Pipage rounding: a new method of constructing algorithms with proven performance guarantee2004-11-22Paper
Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems2004-10-01Paper
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems2004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47375312004-08-11Paper
A note on permutation flow shop problem2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44713542004-07-28Paper
A note on maximizing a submodular set function subject to a knapsack constraint2004-07-01Paper
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme2004-01-08Paper
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP2004-01-08Paper
https://portal.mardi4nfdi.de/entity/Q44289062003-09-22Paper
The diameter of a long-range percolation graph2003-05-25Paper
A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective2003-05-14Paper
A linear time approximation scheme for makespan minimization in an open shop with release dates2003-04-03Paper
Approximation algorithms for shop scheduling problems with minsum objective2002-08-08Paper
Approximating the maximum quadratic assignment problem2002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q45377552002-06-20Paper
Best possible approximation algorithm for MAX SAT with cardinality constraint.2002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27537242002-01-06Paper
https://portal.mardi4nfdi.de/entity/Q27539202001-12-18Paper
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts2001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q45271962001-02-01Paper
https://portal.mardi4nfdi.de/entity/Q49527122001-01-15Paper
https://portal.mardi4nfdi.de/entity/Q42636992000-11-27Paper
Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem2000-11-22Paper
https://portal.mardi4nfdi.de/entity/Q45015552000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49418352000-03-19Paper
An 0. 828-approximation algorithm for the uncapacitated facility location problem1999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42425671999-05-11Paper
https://portal.mardi4nfdi.de/entity/Q42423861999-05-10Paper
https://portal.mardi4nfdi.de/entity/Q44008571998-08-02Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: M. I. Sviridenko