A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing

DOI10.1007/978-3-642-29700-7_16zbMath1304.68208arXiv1007.1260MaRDI QIDQ2897992

Richard Beigel, Bin Fu

Publication date: 16 July 2012

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.1260

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

68W20: Randomized algorithms