O(( n)^2) time online approximation schemes for bin packing and subset sum problems

DOI10.1007/978-3-642-14553-7_24MaRDI QIDQ3587356zbMATH OpenOpenAlexFDO

Authors Liang Ding, Bin Fu, Yunhui Fu, Zaixin Lu, Zhiyu Zhao

Publication date 7 September 2010

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14553-7_24

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Recommendations

• A dense hierarchy of sublinear time approximation schemes for bin packing
• A sublinear-time approximation scheme for bin packing
• An efficient approximation scheme for the subset-sum problem
• A Fast Approximation Algorithm For The Subset-Sum Problem
• A Fast Approximation Algorithm for the Subset-sum Problem

Cited in

(2)

• A sublinear-time approximation scheme for bin packing
• A dense hierarchy of sublinear time approximation schemes for bin packing

This page was built for publication: \(O((\log n)^{2})\) time online approximation schemes for bin packing and subset sum problems

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