Publications

This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.

Date

Start

End

Featured collections

Popular topics

80 results for Maxim Sviridenko

A 5/8 approximation algorithm for the maximum asymmetric TSP
- - Moshe Lewenstein
  - Maxim Sviridenko
- 2003
- SIAM Journal on Discrete Mathematics
Makespan minimization in no-wait flow shops: A polynomial time approximation scheme
- - M. Sviridenko
- 2003
- SIAM Journal on Discrete Mathematics
Makespan minimization in job shops: A linear time approximation scheme
- - Klaus Jansen
  - Roberto Solis-Oba
  - et al.
- 2003
- SIAM Journal on Discrete Mathematics
Approximation algorithms for shop scheduling problems with minsum objective
- - Maurice Queyranne
  - Maxim Sviridenko
- 2002
- Journal of Scheduling
A (2 + ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
- - Maurice Queyranne
  - Maxim Sviridenko
- 2002
- Journal of Algorithms
A linear time approximation scheme for makespan minimization in an open shop with release dates
- - Alexander Kononov
  - Maxim Sviridenko
- 2002
- Operations Research Letters
The Diameter of a Long-Range Percolation Graph
- - Don Coppersmith
  - David Gamarnik
  - et al.
- 2002
- Random Structures and Algorithms
A 0.5-approximation algorithm for MAX DICUT with given sizes of parts
- - Alexander Ageev
  - Refael Hassin
  - et al.
- 2001
- SIAM Journal on Discrete Mathematics
Best possible approximation algorithm for MAX SAT with cardinality constraint
- - M. Sviridenko
- 2001
- Algorithmica (New York)
Approximability and in-approximability results for no-wait shop scheduling
- - Maxim Sviridenko
  - Gerhard J. Woeginger
- 2000
- Annual Symposium on Foundations of Computer Science - Proceedings