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

  • Authors:

  • Liang Ding;Bin Fu;Yunhui Fu;Zaixin Lu;Zhiyu Zhao

  • Affiliations:

  • Department of Computer Science, University of Texas-Pan American, Edinburg, TX;Department of Computer Science, University of Texas-Pan American, Edinburg, TX;Department of Computer Science, University of Texas-Pan American, Edinburg, TX;Department of Computer Science, University of Texas-Pan American, Edinburg, TX;Department of Computer Science, University of New Orleans, New Orleans, LA

  • Venue:
  • FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a set S = {b1, ..., bn} of integers and an integer s, the subset sum problem is to decide if there is a subset S′ of S such that the sum of elements in S′ is exactly equal to s. We present an online approximation scheme for this problem. It updates in O(log n) time and gives a (1+ε)-approximation solution in O((log n+ 1/ε2 (log 1/ε)O(1)) log n) time. The online approximation for target s is to find a subset of the items that have been received. The bin packing problem is to find the minimum number of bins of size one to pack a list of items a1, ..., an of size in [0, 1]. Let function bp(L) be the minimum number of bins to pack all items in the list L. We present an online approximate algorithm for the function bp(L) in the bin packing problem, where L is the list of the items that have been received. It updates in O(log n) updating time and gives a (1 + ε)-approximation solution app(L) for bp(L) in O((log n)2 + (1/ε)O(1/ε)) time to satisfy app(L) ≤ (1 + ε)bp(L) + 1.