Hamiltonian completions of sparse random graphs
- David Gamarnik
- Maxim Sviridenko
- 2005
- Discrete Applied Mathematics
Publications
Date
Featured collections
Popular topics
80 results for Maxim Sviridenko
Minimizing makespan in no-wait job shops
- Nikhil Bansal
- Mohammad Mahdian
- et al.
- 2005
- Mathematics of Operations Research
An improved upper bound for the TSP in cubic 3-edge-connected graphs
- David Gamarnik
- Moshe Lewenstein
- et al.
- 2005
- Operations Research Letters
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
- Markus Bläser
- L. Shankar Ram
- et al.
- 2005
- WADS 2005
Job shop scheduling with unit processing times
- Nikhil Bansal
- Tracy Kimbrel
- et al.
- 2005
- SODA 2005
Unrelated parallel machine scheduling with resource dependent processing times
- Alexander Grigoriev
- Maxim Sviridenko
- et al.
- 2005
- IPCO 2005
Dynamic application placement under service and memory constraints
- Tracy Kimbrel
- Malgorzata Steinder
- et al.
- 2005
- WEA 2005
Pipage rounding: A new method of constructing algorithms with proven performance guarantee
- A.A. Ageev
- M. Sviridenko
- 2004
- J Combin Optim
Buffer overflow management in QoS switches
- Alexander Kesselman
- Zvi Lotker
- et al.
- 2004
- SIAM Journal on Computing
Minimizing Migrations in Fair Multiprocessor Scheduling of Persistent Tasks
- Tracy Kimbrel
- Baruch Schieber
- et al.
- 2004
- SODA 2004