Epstein Leah

Leah Epstein

Information about the author Leah Epstein will soon be added to the site.
Found 25 papers in total
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
2017
We revisit the classic problem of preemptive scheduling on m uniformly related...
Online scheduling of unit jobs on three machines with rejection: A tight result
Online scheduling of unit jobs on three machines with rejection: A tight result
2016
We design an algorithm of the best possible competitive ratio for preemptive and...
Online Clustering with Variable Sized Clusters
Online Clustering with Variable Sized Clusters
2013
Online clustering problems are problems where the classification of points into sets...
Comparing online algorithms for bin packing problems
Comparing online algorithms for bin packing problems
2012
The relative worst‐order ratio is a measure of the quality of online...
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
2012
We continue the study of bin packing with splittable items and cardinality...
On Equilibria for ADM Minimization Games
On Equilibria for ADM Minimization Games
2012
In the ADM minimization problem the input is a set of arcs along a directed ring. The...
Selfish bin coloring
Selfish bin coloring
2011
The bin packing problem, a classical problem in combinatorial optimization, has...
Selfish Bin Packing
Selfish Bin Packing
2011
Following recent interest in the study of computer science problems in a game...
Online scheduling with a buffer on related machines
Online scheduling with a buffer on related machines
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to...
Weighted sum coloring in batch scheduling of conflicting jobs
Weighted sum coloring in batch scheduling of conflicting jobs
2009
Motivated by applications in batch scheduling of jobs in manufacturing systems and...
The hierarchical model for load balancing on two machines
The hierarchical model for load balancing on two machines
2008
Following previous work, we consider the hierarchical load balancing model on two...
Online bin packing with resource augmentation
Online bin packing with resource augmentation
2007
In competitive analysis, we usually do not put any restrictions on the computational...
Semi-online scheduling with ‘end of sequence’ information
Semi-online scheduling with ‘end of sequence’ information
2007
We study a variant of classical scheduling, which is called scheduling with ‘end...
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
2003
The unit price seat reservation problem is investigated. The seat reservation problem...
Separating online scheduling algorithms with the relative worst order ratio
Separating online scheduling algorithms with the relative worst order ratio
2006
The relative worst order ratio is a measure for the quality of online algorithms....
Approximation schemes for scheduling on uniformly related and identical parallel machines
Approximation schemes for scheduling on uniformly related and identical parallel machines
2004
We give a polynomial approximation scheme for the problem of scheduling on uniformly...
A lower bound for on-line scheduling on uniformly related machines
A lower bound for on-line scheduling on uniformly related machines
2000
We consider the problem of on-line scheduling of jobs arriving one by one on uniformly...
On variable sized vector packing
On variable sized vector packing
2003
One of the open problems in on-line packing is the gap between the lower bound...
On-line maximizing the number of items packed in variable-sized bins
On-line maximizing the number of items packed in variable-sized bins
2003
We study on-line bin packing problem. A fixed number of n . of bins, possibly of...
Fair versus unrestricted bin packing
Fair versus unrestricted bin packing
2002
We consider the on-line Dual Bin Packing problem where we have n unit size bins and a...
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
2002
We study a preemptive semi-online scheduling problem. Jobs with non-increasing sizes...
On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
2002
We consider on-line scheduling of unit time jobs on a single machine with...
Randomized on-line scheduling on two uniform machines
Randomized on-line scheduling on two uniform machines
2001
We study the problem of on-line scheduling on two uniform machines with speeds 1 and s...
Resource augmentation in load balancing
Resource augmentation in load balancing
2000
We consider load balancing in the following setting. The on-line algorithm is allowed...
Papers per page: