متابعة
Leah Epstein
Leah Epstein
University of Haifa
بريد إلكتروني تم التحقق منه على math.haifa.ac.il - الصفحة الرئيسية
عنوان
عدد مرات الاقتباسات
عدد مرات الاقتباسات
السنة
Virtual network embedding with opportunistic resource sharing‏
S Zhang, Z Qian, J Wu, S Lu, L Epstein‏
IEEE Transactions on Parallel and Distributed Systems 25 (3), 816-827, 2013‏
1372013
Improved approximation guarantees for weighted matching in the semi-streaming model‏
L Epstein, A Levin, J Mestre, D Segev‏
SIAM Journal on Discrete Mathematics 25 (3), 1251-1265, 2011‏
1212011
Randomized on‐line scheduling on two uniform machines‏
L Epstein, J Noga, S Seiden, J Sgall, G Woeginger‏
Journal of Scheduling 4 (2), 71-92, 2001‏
1162001
On-line scheduling of unit time jobs with rejection: minimizing the total completion time‏
L Epstein, J Noga, GJ Woeginger‏
Operations Research Letters 30 (6), 415-420, 2002‏
972002
Approximation schemes for scheduling on uniformly related and identical parallel machines‏
L Epstein, J Sgall‏
Algorithmica 39 (1), 43-57, 2004‏
952004
Transactional contention management as a non-clairvoyant scheduling problem‏
H Attiya, L Epstein, H Shachnai, T Tamir‏
Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006‏
912006
The (weighted) metric dimension of graphs: hard and easy cases‏
L Epstein, A Levin, GJ Woeginger‏
Algorithmica 72 (4), 1130-1171, 2015‏
862015
On bin packing with conflicts‏
L Epstein, A Levin‏
SIAM Journal on Optimization 19 (3), 1270-1298, 2008‏
862008
A new and improved algorithm for online bin packing‏
J Balogh, J Békési, G Dósa, L Epstein, A Levin‏
arXiv preprint arXiv:1707.01728, 2017‏
842017
All-norm approximation algorithms‏
Y Azar, L Epstein, Y Richter, GJ Woeginger‏
Journal of Algorithms 52 (2), 120-133, 2004‏
822004
New bounds for variable-sized online bin packing‏
SS Seiden, R Van Stee, L Epstein‏
SIAM Journal on Computing 32 (2), 455-469, 2003‏
762003
Universal sequencing on an unreliable machine‏
L Epstein, A Levin, A Marchetti-Spaccamela, N Megow, J Mestre, ...‏
SIAM Journal on Computing 41 (3), 565-586, 2012‏
69*2012
Selfish bin packing‏
L Epstein, E Kleiman‏
Algorithmica 60, 368-394, 2011‏
662011
Bin stretching revisited‏
L Epstein‏
Acta Informatica 39 (2), 97-117, 2003‏
662003
Approximation schemes for scheduling on uniformly related and identical parallel machines‏
L Epstein, J Sgall‏
European Symposium on Algorithms, 151-162, 1999‏
631999
Optimal online algorithms for multidimensional packing problems‏
L Epstein, R Van Stee‏
SIAM Journal on Computing 35 (2), 431-448, 2005‏
602005
On‐line machine covering‏
Y Azar, L Epstein‏
Journal of Scheduling 1 (2), 67-77, 1998‏
601998
A lower bound for on-line scheduling on uniformly related machines‏
L Epstein, J Sgall‏
Operations Research Letters 26 (1), 17-22, 2000‏
592000
Robust algorithms for preemptive scheduling‏
L Epstein, A Levin‏
Algorithmica 69, 26-57, 2014‏
562014
Online square and cube packing‏
L Epstein, R van Stee‏
Acta Informatica 41, 595-606, 2005‏
562005
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20