Stebėti
Rob van Stee
Rob van Stee
Department of Mathematics, University of Siegen, Germany
Patvirtintas el. paštas uni-siegen.de - Pagrindinis puslapis
Pavadinimas
Cituota
Cituota
Metai
Speed scaling of tasks with precedence constraints
K Pruhs, R van Stee, P Uthaisombut
Theory of Computing Systems 43 (1), 67-80, 2008
1602008
Improved competitive guarantees for QoS buffering
A Kesselman, Y Mansour, R Van Stee
Algorithmica 43, 63-80, 2005
1002005
New bounds for multidimensional packing
Seiden
Algorithmica 36, 261-293, 2003
1002003
A (5/3+ ε)-approximation for strip packing
R Harren, K Jansen, L Prädel, R Van Stee
Computational Geometry 47 (2), 248-267, 2014
912014
New bounds for variable-sized online bin packing
SS Seiden, R Van Stee, L Epstein
SIAM Journal on Computing 32 (2), 455-469, 2003
742003
On strip packing with rotations
K Jansen, R van Stee
Proceedings of the Thirty-Seventh annual ACM symposium on Theory of …, 2005
732005
Optimal online algorithms for multidimensional packing problems
L Epstein, R Van Stee
SIAM Journal on Computing 35 (2), 431-448, 2005
582005
Online algorithms with advice for bin packing and scheduling problems
MP Renault, A Rosén, R van Stee
Theoretical Computer Science 600, 155-170, 2015
562015
Online square and cube packing
L Epstein, R van Stee
Acta Informatica 41, 595-606, 2005
562005
Improved absolute approximation ratios for two-dimensional packing problems
R Harren, R van Stee
International Workshop on Approximation Algorithms for Combinatorial …, 2009
542009
Preemptive scheduling in overloaded systems
M Chrobak, L Epstein, J Noga, J Sgall, R van Stee, T Tichý, N Vakhania
Journal of Computer and System Sciences 67 (1), 183-197, 2003
512003
Online bin packing with resource augmentation
L Epstein, R Van Stee
Discrete Optimization 4 (3-4), 322-333, 2007
472007
Lower bounds for on-line single-machine scheduling
L Epstein, R van Stee
Theoretical Computer Science 299 (1-3), 439-450, 2003
472003
The optimal absolute ratio for online bin packing
J Balogh, J Békési, G Dósa, J Sgall, R Stee
Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete …, 2014
462014
Approximation schemes for packing splittable items with cardinality constraints
L Epstein, A Levin, R Van Stee
Algorithmica 62, 102-129, 2012
46*2012
Optimal online bounded space multidimensional packing
L Epstein, R van Stee
Centrum voor Wiskunde en Informatica, 2003
462003
Improved results for a memory allocation problem
L Epstein, R van Stee
Theory of Computing Systems 48 (1), 79-92, 2011
42*2011
Beating the harmonic lower bound for online bin packing
S Heydrich, R van Stee
arXiv preprint arXiv:1511.00876, 2015
402015
This side up!
L Epstein, R Van Stee
ACM Transactions on Algorithms (TALG) 2 (2), 228-243, 2006
392006
On the price of stability for undirected network design
G Christodoulou, C Chung, K Ligett, E Pyrga, R Van Stee
Approximation and Online Algorithms: 7th International Workshop, WAOA 2009 …, 2010
382010
Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.
Straipsniai 1–20