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

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Given a set S = {b 1,⋯, b n } 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(logn) time and gives a (1+ε)-approximation solution in 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 a 1,⋯, a n 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(logn) updating time and gives a (1+ε)-approximation solution app(L) for bp(L) in time to satisfy app(L)≤(1+ε)bp(L)+1.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages250-261
Number of pages12
Volume6213 LNCS
DOIs
StatePublished - 2010
Event4th International Frontiers of Algorithmics Workshop, FAW 2010 - Wuhan, China
Duration: Aug 11 2010Aug 13 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6213 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Frontiers of Algorithmics Workshop, FAW 2010
CountryChina
CityWuhan
Period8/11/108/13/10

Fingerprint

Subset Sum Problem
Bin Packing
Bins
Approximation Scheme
Bin Packing Problem
Application programs
Approximation
Update
Integer
Subset
Approximate Algorithm
Online Algorithms
Updating
Target

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ding, L., Fu, B., Fu, Y., Lu, Z., & Zhao, Z. (2010). O((logn)2) time online approximation schemes for bin packing and subset sum problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6213 LNCS, pp. 250-261). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6213 LNCS). https://doi.org/10.1007/978-3-642-14553-7_24

O((logn)2) time online approximation schemes for bin packing and subset sum problems. / Ding, Liang; Fu, Bin; Fu, Yunhui; Lu, Zaixin; Zhao, Zhiyu.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6213 LNCS 2010. p. 250-261 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6213 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ding, L, Fu, B, Fu, Y, Lu, Z & Zhao, Z 2010, O((logn)2) time online approximation schemes for bin packing and subset sum problems. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6213 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6213 LNCS, pp. 250-261, 4th International Frontiers of Algorithmics Workshop, FAW 2010, Wuhan, China, 8/11/10. https://doi.org/10.1007/978-3-642-14553-7_24
Ding L, Fu B, Fu Y, Lu Z, Zhao Z. O((logn)2) time online approximation schemes for bin packing and subset sum problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6213 LNCS. 2010. p. 250-261. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-14553-7_24
Ding, Liang ; Fu, Bin ; Fu, Yunhui ; Lu, Zaixin ; Zhao, Zhiyu. / O((logn)2) time online approximation schemes for bin packing and subset sum problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6213 LNCS 2010. pp. 250-261 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3301abdd89df45c5aee2335c133e6281,
title = "O((logn)2) time online approximation schemes for bin packing and subset sum problems",
abstract = "Given a set S = {b 1,⋯, b n } 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(logn) time and gives a (1+ε)-approximation solution in 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 a 1,⋯, a n 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(logn) updating time and gives a (1+ε)-approximation solution app(L) for bp(L) in time to satisfy app(L)≤(1+ε)bp(L)+1.",
author = "Liang Ding and Bin Fu and Yunhui Fu and Zaixin Lu and Zhiyu Zhao",
year = "2010",
doi = "10.1007/978-3-642-14553-7_24",
language = "English (US)",
isbn = "3642145523",
volume = "6213 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "250--261",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - O((logn)2) time online approximation schemes for bin packing and subset sum problems

AU - Ding, Liang

AU - Fu, Bin

AU - Fu, Yunhui

AU - Lu, Zaixin

AU - Zhao, Zhiyu

PY - 2010

Y1 - 2010

N2 - Given a set S = {b 1,⋯, b n } 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(logn) time and gives a (1+ε)-approximation solution in 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 a 1,⋯, a n 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(logn) updating time and gives a (1+ε)-approximation solution app(L) for bp(L) in time to satisfy app(L)≤(1+ε)bp(L)+1.

AB - Given a set S = {b 1,⋯, b n } 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(logn) time and gives a (1+ε)-approximation solution in 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 a 1,⋯, a n 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(logn) updating time and gives a (1+ε)-approximation solution app(L) for bp(L) in time to satisfy app(L)≤(1+ε)bp(L)+1.

UR - http://www.scopus.com/inward/record.url?scp=77955864421&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955864421&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14553-7_24

DO - 10.1007/978-3-642-14553-7_24

M3 - Conference contribution

AN - SCOPUS:77955864421

SN - 3642145523

SN - 9783642145520

VL - 6213 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 250

EP - 261

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -