Faster Approximation Schemes for the Two-Dimensional Knapsack Problem

DOI10.1145/3338512zbMath1454.68183OpenAlexW2968986948WikidataQ127392301 ScholiaQ127392301MaRDI QIDQ4973043

Andreas Wiese, Sandy Heydrich

Publication date: 2 December 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3338512

zbMATH Keywords

approximation algorithmEPTASgeometric knapsack problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems

This page was built for publication: Faster Approximation Schemes for the Two-Dimensional Knapsack Problem