Epstein, Leah Several methods of analysis for cardinality constrained bin packing. (English) Zbl 07636002 Theor. Comput. Sci. 942, 213-229 (2023). MSC: 90C27 68Q25 90C59 PDFBibTeX XMLCite \textit{L. Epstein}, Theor. Comput. Sci. 942, 213--229 (2023; Zbl 07636002) Full Text: DOI
Epstein, Leah Open-end bin packing: new and old analysis approaches. (English) Zbl 1500.90056 Discrete Appl. Math. 321, 220-239 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Epstein}, Discrete Appl. Math. 321, 220--239 (2022; Zbl 1500.90056) Full Text: DOI arXiv
Epstein, Leah Several methods of analysis for cardinality constrained bin packing. (English) Zbl 07603888 Koenemann, Jochen (ed.) et al., Approximation and online algorithms. 19th international workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12982, 117-129 (2021). MSC: 68W25 68W27 PDFBibTeX XMLCite \textit{L. Epstein}, Lect. Notes Comput. Sci. 12982, 117--129 (2021; Zbl 07603888) Full Text: DOI arXiv
Epstein, Leah On bin packing with clustering and bin packing with delays. (English) Zbl 1506.90222 Discrete Optim. 41, Article ID 100647, 16 p. (2021). MSC: 90C27 68Q25 68W27 PDFBibTeX XMLCite \textit{L. Epstein}, Discrete Optim. 41, Article ID 100647, 16 p. (2021; Zbl 1506.90222) Full Text: DOI arXiv
Dósa, György; Epstein, Leah Quality of equilibria for selfish bin packing with cost sharing variants. (English) Zbl 1506.90221 Discrete Optim. 38, Article ID 100556, 21 p. (2020). MSC: 90C27 91A10 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{L. Epstein}, Discrete Optim. 38, Article ID 100556, 21 p. (2020; Zbl 1506.90221) Full Text: DOI
Dósa, György; Epstein, Leah Quality of strong equilibria for selfish bin packing with uniform cost sharing. (English) Zbl 1431.90129 J. Sched. 22, No. 4, 473-485 (2019). MSC: 90C27 91A80 91A10 91A43 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{L. Epstein}, J. Sched. 22, No. 4, 473--485 (2019; Zbl 1431.90129) Full Text: DOI
Epstein, Leah; Levin, Asaf Robust algorithms for total completion time. (English) Zbl 1506.90097 Discrete Optim. 33, 70-86 (2019). MSC: 90B35 90C17 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Discrete Optim. 33, 70--86 (2019; Zbl 1506.90097) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf A new and improved algorithm for online bin packing. (English) Zbl 1522.68758 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 5, 14 p. (2018). MSC: 68W27 68W40 90C27 PDFBibTeX XMLCite \textit{J. Balogh} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 5, 14 p. (2018; Zbl 1522.68758) Full Text: DOI arXiv
Epstein, Leah; Levin, Asaf The benefit of preemption with respect to the \(\ell_p\) norm. (English) Zbl 1525.90198 Oper. Res. Lett. 46, No. 4, 462-468 (2018). MSC: 90B35 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Oper. Res. Lett. 46, No. 4, 462--468 (2018; Zbl 1525.90198) Full Text: DOI
Epstein, Leah; Yatsiv, Ido Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times. (English) Zbl 1373.90056 J. Sched. 20, No. 2, 115-127 (2017). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{I. Yatsiv}, J. Sched. 20, No. 2, 115--127 (2017; Zbl 1373.90056) Full Text: DOI
Epstein, Leah; Levin, Asaf; Soper, Alan J.; Strusevich, Vitaly A. Power of preemption for minimizing total completion time on uniform parallel machines. (English) Zbl 1354.90049 SIAM J. Discrete Math. 31, No. 1, 101-123 (2017). MSC: 90B35 68R99 68W40 PDFBibTeX XMLCite \textit{L. Epstein} et al., SIAM J. Discrete Math. 31, No. 1, 101--123 (2017; Zbl 1354.90049) Full Text: DOI
Epstein, Leah More on batched bin packing. (English) Zbl 1408.90251 Oper. Res. Lett. 44, No. 2, 273-277 (2016). MSC: 90C27 68W25 90C60 PDFBibTeX XMLCite \textit{L. Epstein}, Oper. Res. Lett. 44, No. 2, 273--277 (2016; Zbl 1408.90251) Full Text: DOI
Epstein, Leah; Levin, Asaf; van Stee, Rob A unified approach to truthful scheduling on related machines. (English) Zbl 1353.68300 Math. Oper. Res. 41, No. 1, 332-351 (2016). MSC: 68W25 68W40 90B35 PDFBibTeX XMLCite \textit{L. Epstein} et al., Math. Oper. Res. 41, No. 1, 332--351 (2016; Zbl 1353.68300) Full Text: DOI arXiv
Epstein, Leah; Levin, Asaf Robust algorithms for preemptive scheduling. (English) Zbl 1307.68091 Algorithmica 69, No. 1, 26-57 (2014). MSC: 68W05 68W27 90B35 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Algorithmica 69, No. 1, 26--57 (2014; Zbl 1307.68091) Full Text: DOI
Epstein, Leah; Levin, Asaf An efficient polynomial time approximation scheme for load balancing on uniformly related machines. (English) Zbl 1297.68264 Math. Program. 147, No. 1-2 (A), 1-23 (2014). MSC: 68W25 68Q25 90C27 90C59 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Math. Program. 147, No. 1--2 (A), 1--23 (2014; Zbl 1297.68264) Full Text: DOI arXiv
Adar, Ron; Epstein, Leah Selfish bin packing with cardinality constraints. (English) Zbl 1295.91005 Theor. Comput. Sci. 495, 66-80 (2013). MSC: 91A10 90C27 PDFBibTeX XMLCite \textit{R. Adar} and \textit{L. Epstein}, Theor. Comput. Sci. 495, 66--80 (2013; Zbl 1295.91005) Full Text: DOI
Chen, Xujin; Epstein, Leah; Kleiman, Elena; van Stee, Rob Maximizing the minimum load: the cost of selfishness. (English) Zbl 1291.90090 Theor. Comput. Sci. 482, 9-19 (2013). MSC: 90B35 PDFBibTeX XMLCite \textit{X. Chen} et al., Theor. Comput. Sci. 482, 9--19 (2013; Zbl 1291.90090) Full Text: DOI
Epstein, Leah; Levin, Asaf Bin packing with general cost structures. (English) Zbl 1274.90304 Math. Program. 132, No. 1-2 (A), 355-391 (2012). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Math. Program. 132, No. 1--2 (A), 355--391 (2012; Zbl 1274.90304) Full Text: DOI
Epstein, Leah; Favrholdt, Lene M.; Levin, Asaf Online variable-sized bin packing with conflicts. (English) Zbl 1241.90106 Discrete Optim. 8, No. 2, 333-343 (2011). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Epstein} et al., Discrete Optim. 8, No. 2, 333--343 (2011; Zbl 1241.90106) Full Text: DOI
Epstein, Leah; Kleiman, Elena Selfish bin packing. (English) Zbl 1213.90211 Algorithmica 60, No. 2, 368-394 (2011). MSC: 90C27 91A80 68T42 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{E. Kleiman}, Algorithmica 60, No. 2, 368--394 (2011; Zbl 1213.90211) Full Text: DOI
Epstein, Leah; Levy, Meital Dynamic multi-dimensional bin packing. (English) Zbl 1208.90144 J. Discrete Algorithms 8, No. 4, 356-372 (2010). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{M. Levy}, J. Discrete Algorithms 8, No. 4, 356--372 (2010; Zbl 1208.90144) Full Text: DOI
Epstein, Leah; Imreh, Csanád; Levin, Asaf Class constrained bin covering. (English) Zbl 1209.68659 Theory Comput. Syst. 46, No. 2, 246-260 (2010). MSC: 68W27 68W25 PDFBibTeX XMLCite \textit{L. Epstein} et al., Theory Comput. Syst. 46, No. 2, 246--260 (2010; Zbl 1209.68659) Full Text: DOI
Epstein, Leah Bin packing with rejection revisited. (English) Zbl 1187.68719 Algorithmica 56, No. 4, 505-528 (2010). MSC: 68W27 68W25 PDFBibTeX XMLCite \textit{L. Epstein}, Algorithmica 56, No. 4, 505--528 (2010; Zbl 1187.68719) Full Text: DOI
Bein, Wolfgang; Epstein, Leah; Larmore, Lawrence L.; Noga, John Optimally competitive list batching. (English) Zbl 1171.68053 Theor. Comput. Sci. 410, No. 38-40, 3631-3639 (2009). MSC: 68W40 90B35 PDFBibTeX XMLCite \textit{W. Bein} et al., Theor. Comput. Sci. 410, No. 38--40, 3631--3639 (2009; Zbl 1171.68053) Full Text: DOI
Epstein, Leah; Erlebach, Thomas; Levin, Asaf Variable sized online interval coloring with bandwidth. (English) Zbl 1172.68059 Algorithmica 53, No. 3, 385-401 (2009). MSC: 68W05 05C15 05C78 05C85 68Q17 68W25 68W40 PDFBibTeX XMLCite \textit{L. Epstein} et al., Algorithmica 53, No. 3, 385--401 (2009; Zbl 1172.68059) Full Text: DOI Link
Epstein, Leah; Levin, Asaf A robust APTAS for the classical bin packing problem. (English) Zbl 1163.90018 Math. Program. 119, No. 1 (A), 33-49 (2009). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Math. Program. 119, No. 1 (A), 33--49 (2009; Zbl 1163.90018) Full Text: DOI
Correa, José R.; Epstein, Leah Bin packing with controllable item sizes. (English) Zbl 1169.90018 Inf. Comput. 206, No. 8, 1003-1016 (2008). MSC: 90C27 68W25 68W40 90C59 91B32 PDFBibTeX XMLCite \textit{J. R. Correa} and \textit{L. Epstein}, Inf. Comput. 206, No. 8, 1003--1016 (2008; Zbl 1169.90018) Full Text: DOI
Epstein, Leah; Kleiman, Elena Selfish bin packing. (English) Zbl 1158.91333 Halperin, Dan (ed.) et al., Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). Lecture Notes in Computer Science 5193, 368-380 (2008). MSC: 91A80 68M10 68M14 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{E. Kleiman}, Lect. Notes Comput. Sci. 5193, 368--380 (2008; Zbl 1158.91333) Full Text: DOI
Epstein, Leah; Levin, Asaf More on online bin packing with two item sizes. (English) Zbl 1151.90500 Discrete Optim. 5, No. 4, 705-713 (2008). MSC: 90C10 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Discrete Optim. 5, No. 4, 705--713 (2008; Zbl 1151.90500) Full Text: DOI
Epstein, Leah; Levin, Asaf; van Stee, Rob Online unit clustering: Variations on a theme. (English) Zbl 1152.68060 Theor. Comput. Sci. 407, No. 1-3, 85-96 (2008). MSC: 68W40 68T10 91C20 PDFBibTeX XMLCite \textit{L. Epstein} et al., Theor. Comput. Sci. 407, No. 1--3, 85--96 (2008; Zbl 1152.68060) Full Text: DOI
Epstein, Leah; Levin, Asaf; van Stee, Rob Two-dimensional packing with conflicts. (English) Zbl 1144.68051 Acta Inf. 45, No. 3, 155-175 (2008). MSC: 68W25 05C85 90C27 PDFBibTeX XMLCite \textit{L. Epstein} et al., Acta Inf. 45, No. 3, 155--175 (2008; Zbl 1144.68051) Full Text: DOI
Epstein, Leah; Levin, Asaf Minimum weighted sum bin packing. (English) Zbl 1130.90039 Kaklamanis, Christos (ed.) et al., Approximation and online algorithms. 5th international workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77917-9/pbk). Lecture Notes in Computer Science 4927, 218-231 (2008). MSC: 90C27 90B35 90C59 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Lect. Notes Comput. Sci. 4927, 218--231 (2008; Zbl 1130.90039) Full Text: DOI
Epstein, Leah; van Stee, Rob Online bin packing with resource augmentation. (English) Zbl 1135.68627 Discrete Optim. 4, No. 3-4, 322-333 (2007). MSC: 68W05 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{R. van Stee}, Discrete Optim. 4, No. 3--4, 322--333 (2007; Zbl 1135.68627) Full Text: DOI Link
Epstein, Leah; Tassa, Tamir Vector assignment schemes for asymmetric settings. (English) Zbl 1089.68025 Acta Inf. 42, No. 6-7, 501-514 (2006). MSC: 68M20 68W25 90B35 90C59 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{T. Tassa}, Acta Inf. 42, No. 6--7, 501--514 (2006; Zbl 1089.68025) Full Text: DOI
Epstein, Leah; Tassa, Tamir Optimal preemptive scheduling for general target functions. (English) Zbl 1105.68009 J. Comput. Syst. Sci. 72, No. 1, 132-162 (2006). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{T. Tassa}, J. Comput. Syst. Sci. 72, No. 1, 132--162 (2006; Zbl 1105.68009) Full Text: DOI
Azar, Yossi; Epstein, Leah On two dimensional packing. (English) Zbl 1502.90140 Karlsson, Rolf (ed.) et al., Algorithm theory – SWAT ’96. 5th Scandinavian workshop on algorithm theory, Reykjavík, Iceland, July 3–5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1097, 321-332 (1996). MSC: 90C27 68W40 PDFBibTeX XMLCite \textit{Y. Azar} and \textit{L. Epstein}, Lect. Notes Comput. Sci. 1097, 321--332 (1996; Zbl 1502.90140) Full Text: DOI