A parameterized approximation scheme for the geometric knapsack problem with wide items

DOI10.4230/LIPICS.IPEC.2023.33MaRDI QIDQ6926174zbMATH OpenFDO

Authors Mathieu Mari, Timothe Picavet, Michał Pilipczuk

Publication date 24 September 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

dynamic programmingcomputational geometryparameterized complexityapproximation schemecolor codinggeometric knapsack

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: A parameterized approximation scheme for the geometric knapsack problem with wide items

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926174)