A faster FPTAS for the unbounded knapsack problem

DOI10.1007/978-3-319-29516-9_23MaRDI QIDQ6827556zbMATH OpenFDO

Authors Klaus Jansen, Stefan E. J. Kraft

Publication date 4 April 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-29516-9_23

zbMATH Keywords

Unbounded Knapsack Problem, approximation schemes

Mathematics Subject Classification ID

Approximation algorithms (68W25) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

This page was built for publication: A faster FPTAS for the unbounded knapsack problem

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