#### Filter Results:

- Full text PDF available (44)

#### Publication Year

1998

2019

- This year (1)
- Last 5 years (25)
- Last 10 years (74)

#### Supplemental Content

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Alexander A. Ageev, Maxim Sviridenko
- J. Comb. Optim.
- 2004

The paper presents a general method of designing constant-factor approximation algorithms for some discrete optimization problems with assignment-type constraints. The core of the method is a simple… (More)

- Maxim Sviridenko
- Oper. Res. Lett.
- 2004

In this paper, we obtain an (1-e^-^1)-approximation algorithm for maximizing a nondecreasing submodular set function subject to a knapsack constraint. This algorithm requires O(n^5) function value… (More)

A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f ij , for assigning item j to bin i; and a separate packing constraint for each bin… (More)

- Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
- SIAM J. Comput.
- 2004

We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the order in which they arrive; the… (More)

- Nikhil Bansal, Maxim Sviridenko
- STOC
- 2006

We consider the following problem: The Santa Claus has n presents that he wants to distribute among m kids. Each kid has an arbitrary value for each present. Let p<sub>ij</sub> be the value that kid… (More)

- Foto N. Afrati, Evripidis Bampis, +8 authors Maxim Sviridenko
- 40th Annual Symposium on Foundations of Computer…
- 1999

We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation… (More)

- Alexander A. Ageev, Maxim Sviridenko
- IPCO
- 1999

In this paper we demonstrate a general method of designing constant-factor approximation algorithms for some discrete optimization problems with cardinality constraints. The core of the method is a… (More)

- Nikhil Bansal, José R. Correa, Claire Mathieu, Maxim Sviridenko
- Math. Oper. Res.
- 2006

We study the following packing problem: Given a collection of d-dimensional rectangles of specified sizes, pack them into the minimum number of unit cubes. We show that unlike the one-dimensional… (More)

- Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
- 47th Annual IEEE Symposium on Foundations of…
- 2006

In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the linear programming (LP) relaxation,… (More)

- Maxim Sviridenko
- IPCO
- 2002

We design a new approximation algorithm for the metric uncapacitated facility location problem. This algorithm is of LP rounding type and is based on a rounding technique developed in [5,6,7].