Leah Epstein
Leah Epstein
Email verificata su math.haifa.ac.il - Home page
Titolo
Citata da
Citata da
Anno
Approximation schemes for scheduling on uniformly related and identical parallel machines
L Epstein, J Sgall
Algorithmica 39 (1), 43-57, 2004
126*2004
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
1102013
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
1022001
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
992011
On bin packing with conflicts
L Epstein, A Levin
SIAM Journal on Optimization 19 (3), 1270-1298, 2008
942008
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
822002
Transactional contention management as a non-clairvoyant scheduling problem
H Attiya, L Epstein, H Shachnai, T Tamir
Algorithmica 57 (1), 44-61, 2010
802010
All-norm approximation algorithms
Y Azar, L Epstein, Y Richter, GJ Woeginger
Journal of Algorithms 52 (2), 120-133, 2004
732004
New bounds for variable-sized online bin packing
SS Seiden, R Van Stee, L Epstein
SIAM Journal on Computing 32 (2), 455-469, 2003
632003
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
60*2012
Selfish bin packing
L Epstein, E Kleiman
Algorithmica 60 (2), 368-394, 2011
562011
Bin stretching revisited
L Epstein
Acta Informatica 39 (2), 97-117, 2003
562003
A lower bound for on-line scheduling on uniformly related machines
L Epstein, J Sgall
Operations Research Letters 26 (1), 17-22, 2000
542000
Optimal online algorithms for multidimensional packing problems
L Epstein, R Van Stee
SIAM Journal on Computing 35 (2), 431-448, 2005
522005
The (weighted) metric dimension of graphs: hard and easy cases
L Epstein, A Levin, GJ Woeginger
Algorithmica 72 (4), 1130-1171, 2015
502015
Better bounds for minimizing SONET ADMs
L Epstein, A Levin
Journal of Computer and System Sciences 75 (2), 122-136, 2009
46*2009
Online bin packing with cardinality constraints
L Epstein
SIAM Journal on Discrete Mathematics 20 (4), 1015-1030, 2006
452006
Online square and cube packing
L Epstein, R van Stee
Acta Informatica 41 (9), 595-606, 2005
452005
The maximum resource bin packing problem
J Boyar, L Epstein, LM Favrholdt, JS Kohrt, KS Larsen, MM Pedersen, ...
Theoretical Computer Science 362 (1), 127-139, 2006
432006
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
L Epstein, LM Favrholdt
Operations Research Letters 30 (4), 269-275, 2002
432002
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–20