Constant-Time Approximation Algorithms for the Knapsack Problem
From MaRDI portal
Publication:2898024
DOI10.1007/978-3-642-29952-0_17zbMath1354.68299OpenAlexW329165401MaRDI QIDQ2898024
Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida
Publication date: 16 July 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29952-0_17
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (2)
The online knapsack problem with incremental capacity ⋮ Randomized algorithms for online knapsack problems
This page was built for publication: Constant-Time Approximation Algorithms for the Knapsack Problem
