Sviridenko Maxim

Maxim Sviridenko

Information about the author Maxim Sviridenko will soon be added to the site.
Found 17 papers in total
A note on the Kenyon‐Remila strip-packing algorithm
A note on the Kenyon‐Remila strip-packing algorithm
2012
We show that a modification of the Kenyon–Remila algorithm for the...
Discretization orders for distance geometry problems
Discretization orders for distance geometry problems
2012
Given a weighted, undirected simple graph G = ( V , E , d ) (where d : E → ℝ...
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Tight Approximation Algorithms for Maximum Separable Assignment Problems
2011
A separable assignment problem ( SAP ) is defined by a set of bins and a set of items...
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
2010
Submodular function maximization is a central problem in combinatorial optimization,...
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
2009
We consider an APX-hard variant (Δ-Max-ATSP) and an APX-hard relaxation...
High-multiplicity cyclic job shop scheduling
High-multiplicity cyclic job shop scheduling
2008
We consider the High-Multiplicity Cyclic Job Shop Scheduling Problem . There are two...
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
2008
We study the classical capacitated multi–item lot–sizing problem with hard...
Tight bounds for permutation flow shop scheduling
Tight bounds for permutation flow shop scheduling
2009
In flow shop scheduling there are m machines and n jobs, such that every job has to be...
Bin packing in multiple dimensions: Inapproximability results and approximation schemes
Bin packing in multiple dimensions: Inapproximability results and approximation schemes
2006
We study the following packing problem: Given a collection of d–dimensional...
Job shop scheduling with unit processing times
Job shop scheduling with unit processing times
2006
We consider randomized algorithms for the preemptive job shop problem, or...
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
2006
Suppose that we are given n persistent tasks (jobs) that need to be executed in an...
Two-dimensional bin packing with one-dimensional resource augmentation
Two-dimensional bin packing with one-dimensional resource augmentation
2007
The two-dimensional bin packing problem is a generalization of the classical bin...
Minimizing makespan in no-wait job shops
Minimizing makespan in no-wait job shops
2005
In this paper, we study polynomial time approximation schemes (PTASes) for the no-wait...
An improved upper bound for the traveling salesman problem in cubic 3-edge-connected graphs
An improved upper bound for the traveling salesman problem in cubic 3-edge-connected graphs
2005
We consider the traveling salesman problem (TSP) on (the metric completion of)...
A note on maximizing a submodular set function subject to a knapsack constraint
A note on maximizing a submodular set function subject to a knapsack constraint
2004
In this paper, we obtain an (1-e -1 )-approximation algorithm for maximizing a...
Approximation algorithms for shop scheduling problems with minsum objective
Approximation algorithms for shop scheduling problems with minsum objective
2002
We consider a general class of multiprocessor shop scheduling problems, preemptive or...
A linear time approximation scheme for makespan minimization in an open shop with release dates
A linear time approximation scheme for makespan minimization in an open shop with release dates
2002
In this paper, we demonstrate the existence of a linear time approximation scheme for...
Papers per page: