Gálvez, Waldo; Grandoni, Fabrizio; Ingala, Salvatore; Heydrich, Sandy; Khan, Arindam; Wiese, Andreas Approximating geometric knapsack via L-packings. (English) Zbl 07479303 ACM Trans. Algorithms 17, No. 4, Article No. 33, 67 p. (2021). MSC: 68-XX PDFBibTeX XMLCite \textit{W. Gálvez} et al., ACM Trans. Algorithms 17, No. 4, Article No. 33, 67 p. (2021; Zbl 07479303) Full Text: DOI arXiv
Heydrich, Sandy; Wiese, Andreas Faster approximation schemes for the two-dimensional knapsack problem. (English) Zbl 1454.68183 ACM Trans. Algorithms 15, No. 4, Article No. 47, 28 p. (2019). MSC: 68W25 68Q25 90C27 PDFBibTeX XMLCite \textit{S. Heydrich} and \textit{A. Wiese}, ACM Trans. Algorithms 15, No. 4, Article No. 47, 28 p. (2019; Zbl 1454.68183) Full Text: DOI
Anagnostopoulos, Aris; Grandoni, Fabrizio; Leonardi, Stefano; Wiese, Andreas A mazing \(2+\epsilon\) approximation for unsplittable flow on a path. (English) Zbl 1422.68278 ACM Trans. Algorithms 14, No. 4, Article No. 55, 23 p. (2018). MSC: 68W25 05C21 68R10 90C35 90C59 PDFBibTeX XMLCite \textit{A. Anagnostopoulos} et al., ACM Trans. Algorithms 14, No. 4, Article No. 55, 23 p. (2018; Zbl 1422.68278) Full Text: DOI
Lübbecke, Elisabeth; Maurer, Olaf; Megow, Nicole; Wiese, Andreas A new approach to online scheduling: approximating the optimal competitive ratio. (English) Zbl 1421.68251 ACM Trans. Algorithms 13, No. 1, Article No. 15, 34 p. (2016). MSC: 68W27 68W20 90B35 PDFBibTeX XMLCite \textit{E. Lübbecke} et al., ACM Trans. Algorithms 13, No. 1, Article No. 15, 34 p. (2016; Zbl 1421.68251) Full Text: DOI