Grandoni, Fabrizio; Mömke, Tobias; Wiese, Andreas A PTAS for unsplittable flow on a path. (English) Zbl 07774340 Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 289-302 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. Grandoni} et al., in: Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC '22, Rome, Italy June 20--24, 2022. New York, NY: Association for Computing Machinery (ACM). 289--302 (2022; Zbl 07774340) Full Text: DOI
Grandoni, Fabrizio; Mömke, Tobias; Wiese, Andreas Faster \((1+ \varepsilon)\)-approximation for unsplittable flow on a path via resource augmentation and back. (English) Zbl 07740904 Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 49, 15 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Grandoni} et al., LIPIcs -- Leibniz Int. Proc. Inform. 204, Article 49, 15 p. (2021; Zbl 07740904) Full Text: DOI
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
Grandoni, Fabrizio; Wiese, Andreas Packing cars into narrow roads: PTASs for limited supply highway. (English) Zbl 07525491 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 54, 14 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Grandoni} and \textit{A. Wiese}, LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 54, 14 p. (2019; Zbl 07525491) Full Text: DOI
Grandoni, Fabrizio; Kratsch, Stefan; Wiese, Andreas Parameterized approximation schemes for independent set of rectangles and geometric knapsack. (English) Zbl 07525490 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 53, 16 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Grandoni} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 53, 16 p. (2019; Zbl 07525490) Full Text: DOI arXiv
Grandoni, Fabrizio; Mömke, Tobias; Wiese, Andreas; Zhou, Hang A \((5/3+\varepsilon)\)-approximation for unsplittable flow on a path: placing small tasks into boxes. (English) Zbl 1422.68298 Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 607-619 (2018). MSC: 68W25 05C21 68R10 90C35 90C59 PDFBibTeX XMLCite \textit{F. Grandoni} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 607--619 (2018; Zbl 1422.68298) 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
Grandoni, Fabrizio; Mömke, Tobias; Wiese, Andreas; Zhou, Hang To augment or not to augment: solving unsplittable flow on a path by creating slack. (English) Zbl 1411.68188 Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2411-2422 (2017). MSC: 68W25 68Q25 90B10 90C35 PDFBibTeX XMLCite \textit{F. Grandoni} et al., in: Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16--19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2411--2422 (2017; Zbl 1411.68188) Full Text: DOI
Anagnostopoulos, Aris; Grandoni, Fabrizio; Leonardi, Stefano; Wiese, Andreas A mazing \(2+\varepsilon\) approximation for unsplittable flow on a path. (English) Zbl 1422.68279 Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 26-41 (2014). MSC: 68W25 05C21 68R10 90C35 90C59 PDFBibTeX XMLCite \textit{A. Anagnostopoulos} et al., in: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5--7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 26--41 (2014; Zbl 1422.68279) Full Text: DOI arXiv
Anagnostopoulos, Aris; Grandoni, Fabrizio; Leonardi, Stefano; Wiese, Andreas Constant integrality gap LP formulations of unsplittable flow on a path. (English) Zbl 1331.90086 Goemans, Michel (ed.) et al., Integer programming and combinatorial optimization. 16th international conference, IPCO 2013, Valparaíso, Chile, March 18–20, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36693-2/pbk). Lecture Notes in Computer Science 7801, 25-36 (2013). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{A. Anagnostopoulos} et al., Lect. Notes Comput. Sci. 7801, 25--36 (2013; Zbl 1331.90086) Full Text: DOI