Makespan minimization in no-wait flow shops: A polynomial time approximation scheme
- M. Sviridenko
- 2003
- SIAM Journal on Discrete Mathematics
Publications
Date
Featured collections
Popular topics
32 results at 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
Multidimensional convolutional codes
- Bruce Kitchens
- 2002
- SIAM Journal on Discrete Mathematics
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
Approximating minimum subset feedback sets in undirected graphs with applications
- Guy Even
- Joseph Naor
- et al.
- 2000
- SIAM Journal on Discrete Mathematics
Two-dimensional gantt charts and a scheduling algorithm of lawler
- Michel X. Goemans
- David P. Williamson
- 2000
- SIAM Journal on Discrete Mathematics
Improved algorithms and analysis for secretary problems and generalizations
- Miklos Ajtai
- Nimrod Megiddo
- et al.
- 2000
- SIAM Journal on Discrete Mathematics
Finding subsets maximizing minimum structures
- Magnús M. Halldórsson
- Kazuo Iwano
- et al.
- 1999
- SIAM Journal on Discrete Mathematics
A geometric approach to betweenness
- Benny Chor
- Madhu Sudan
- 1998
- SIAM Journal on Discrete Mathematics
A characterization of nonnegative box-greedy matrices
- Ulrich Faigle
- Alan J. Hoffman
- et al.
- 1996
- SIAM Journal on Discrete Mathematics