The following pages link to Leah Epstein (Q189394):
Displayed 50 items.
- Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Vertex cover meets scheduling (Q270025) (← links)
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- Selfish bin packing with cardinality constraints (Q391143) (← links)
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
- Selfish bin coloring (Q411255) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- On the absolute approximation ratio for first fit and related results (Q442205) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
- Selfish bin packing (Q534779) (← links)
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
- Dynamic multi-dimensional bin packing (Q616986) (← links)
- Graph coloring with rejection (Q632809) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- On the max coloring problem (Q690449) (← links)
- Fair versus unrestricted bin packing (Q699764) (← links)
- Online scheduling with a buffer on related machines (Q711400) (← links)
- Min-sum bin packing (Q721936) (← links)
- Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
- Randomized algorithms for online bounded bidding (Q763539) (← links)
- The chord version for SONET ADMs minimization (Q817808) (← links)
- Optimally competitive list batching (Q837154) (← links)
- Transactional contention management as a Non-clairvoyant scheduling problem (Q848634) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- On the remote server problem or more about TCP acknowledgments (Q861268) (← links)
- Paging with connections: FIFO strikes again (Q884462) (← links)
- Online scheduling of unit jobs on three machines with rejection: a tight result (Q903197) (← links)
- A PTAS for delay minimization in establishing wireless conference calls (Q924635) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- Online interval coloring with packing constraints (Q954991) (← links)
- More on online bin packing with two item sizes (Q955329) (← links)
- Resource augmented semi-online bounded space bin packing (Q967321) (← links)
- Class constrained bin covering (Q970104) (← links)
- Tight results for next fit and worst fit with resource augmentation (Q974751) (← links)
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing (Q975519) (← links)
- Two-dimensional online bin packing with rotation (Q982663) (← links)
- Class constrained bin packing revisited (Q986543) (← links)
- Improved randomized results for the interval selection problem (Q986549) (← links)
- On the sum minimization version of the online bin covering problem (Q987687) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)