Article

Free access

On the sum-of-squares algorithm for bin packing

Authors:

Richard R. WeberAuthors Info & Claims

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

Pages 208 - 217

https://doi.org/10.1145/335305.335331

Published: 01 May 2000 Publication History

PDF eReader

References

[1]

S. Albers and M. Mitzenmacher. Average-case analyses of first fit and random fit bin packing, in Proc. Ninth Annual A CM-SIAM Symposium on Discrete Algorithms, pages 290-299, Philadelphia, 1998. Society for Industrial and Applied Mathematics.]]

Digital Library

Google Scholar

[2]

E. G. Coffman, Jr., C. Courcoubetis, M. R. Garey, D. S. Johnson, L. A. McGeoch, P. W. Shor, R. R. Weber, and M. Yannakakis. Fundamental discrepancies between average-case analyses under discrete and continuous distributions. In Proceedings 23rd Annual A CM Symposium on Theory of Computing, pages 230-240, New York, 1991. ACM Press.]]

Digital Library

Google Scholar

[3]

E. G. Coffman, Jr., C. Courcoubetis, M. R. Garey, D. S. Johnson, P. W. Shor, R. R. Weber, and M. Yannakakis. Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings. SIAM J. Disc. Math. To appear.]]

Digital Library

Google Scholar

[4]

E. G. Coffman, Jr., D. S. Johnson, L. A. McGeoch, P. W. Shor, and R. R. Weber. Bin packing with discrete item sizes, Part III: Average-case behavior of FFD and BFD. In preparation.]]

Google Scholar

[5]

E. G. Coffman, Jr., D. S. johnson, P. W. Shor, and R. R. Weber. Markov chains, computer proofs, and average-case analysis of Best Fit bin packing. In Proceedings ~5th Annual.ACM Symposium on Theory of Computing, pages 412-421, New York, 1993. ACM Press.]]

Digital Library

Google Scholar

[6]

E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber. Bin packing with discrete item sizes, Part II: Tight bounds on First Fit. Random Structures and Algorithms, 10:69-101, 1997.]]

Digital Library

Google Scholar

[7]

C. Courcoubetis and R. R. Weber. Stability of on-line bin packing with random arrivals and long-run average constraints. Prob. Eng. Inf. Sci., 4:447-460, 1990.]]

Crossref

Google Scholar

[8]

J. Csirik, D. S. Johnson, C. Kenyon, P. W. Shor, and R. R. Weber. A self organizing bin packing heuristic. In M. Goodrich and C. C. McGeoch, editors, Proceedings 1999 Workshop on Algorithm Engineering and Experimentation, pages 246-265, Berlin, 1999. Lecture Notes in Computer Science 1619, Springer-Verlag.]]

Digital Library

Google Scholar

[9]

W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1 +e in linear time. Combinatorica, 1:349-355, 1981.]]

Crossref

Google Scholar

[10]

B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Prob., 14:502-525, 1982.]]

Crossref

Google Scholar

[11]

N. Karmarkar and R. M. Karp. An efficient approximation scheme for the one-dimensional bin packing problem. In Proc. 23rd Ann. Syrup. on Foundations of Computer Science, pages 312-320, 1982. IEEE Computer Soc.]]

Digital Library

Google Scholar

[12]

C. Kenyon, Y. Rabani, and A. Sinclair. Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing. J. Algorithms, 27:218-235, 1998. Preliminary version under the same title appeared in Proc. Seventh Annual A CM-SIAM Symposium on Discrete Algorithms, pages 351-358, 1996.]]

Digital Library

Google Scholar

[13]

W. T. Rhee. Optimal bin packing with items of random sizes. Math. Oper. Res., 13:140-151, 1988.]]

Crossref

Google Scholar

[14]

W. T. Rhee and M. Talagrand. On line bin packing with items of random size. Math. Oper. Res., 18:438- 445, 1993.]]

Crossref

Google Scholar

[15]

W. T. Rhee and M. Talagrand. On line bin packing with items of random sizes- II. SIAM J. Comput., 22:1251- 1256, 1993.]]

Digital Library

Google Scholar

[16]

P. M. Vaidya. Speeding-up linear programming using fast matrix multiplication. In Proceedings, The 30th Annual Symposium on Foundations of Computer Science, pages 332-337, Los Alamitos, CA, 1989. IEEE Computer Society Press.]]

Digital Library

Google Scholar

[17]

D. B. Wilson. Personal communication, 2000.]]

Google Scholar

Cited By

View all

Beigel RFu B(2012)A dense hierarchy of sublinear time approximation schemes for bin packingProceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management10.1007/978-3-642-29700-7_16(172-181)Online publication date: 14-May-2012
https://dl.acm.org/doi/10.1007/978-3-642-29700-7_16
Ding LFu BFu YLu ZZhao Z(2010)O((log n)2) time online approximation schemes for bin packing and subset sum problemsProceedings of the 4th international conference on Frontiers in algorithmics10.5555/1881195.1881219(250-261)Online publication date: 11-Aug-2010
https://dl.acm.org/doi/10.5555/1881195.1881219
Ding LFu BFu YLu ZZhao Z(2010)O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum ProblemsFrontiers in Algorithmics10.1007/978-3-642-14553-7_24(250-261)Online publication date: 2010
https://doi.org/10.1007/978-3-642-14553-7_24
Show More Cited By

Index Terms

On the sum-of-squares algorithm for bin packing
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical analysis
    1. Mathematical optimization
      1. Continuous optimization
        Linear programming
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems
    2. Mathematical optimization
      1. Continuous optimization
        Linear programming

Recommendations

Modified subset sum heuristics for bin packing

We analyze the worst-case ratio of natural variations of the so-called subset sum heuristic for the bin packing problem, which proceeds by filling one bin at a time, each as much as possible. Namely, we consider the variation in which the largest ...
Strip Packing vs. Bin Packing
AAIM '07: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management

In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) ...
Min-Sum Bin Packing

We study min-sum bin packing (MSBP). This is a bin packing problem, where the cost of an item is the index of the bin into which it is packed. The problem is equivalent to a batch scheduling problem we define, where the total completion time is to be ...

Comments

Information & Contributors

Information

Published In

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

May 2000

756 pages

ISBN:1581131844

DOI:10.1145/335305

Chairmen:
Frances Yao,
Eugene Luks

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC00

Sponsor:

SIGACT

STOC00: The 32nd Annual ACM Symposium on Theory of Computing

May 21 - 23, 2000

Oregon, Portland, USA

Acceptance Rates

STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
631
Total Downloads

Downloads (Last 12 months)56
Downloads (Last 6 weeks)9

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Beigel RFu B(2012)A dense hierarchy of sublinear time approximation schemes for bin packingProceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management10.1007/978-3-642-29700-7_16(172-181)Online publication date: 14-May-2012
https://dl.acm.org/doi/10.1007/978-3-642-29700-7_16
Ding LFu BFu YLu ZZhao Z(2010)O((log n)2) time online approximation schemes for bin packing and subset sum problemsProceedings of the 4th international conference on Frontiers in algorithmics10.5555/1881195.1881219(250-261)Online publication date: 11-Aug-2010
https://dl.acm.org/doi/10.5555/1881195.1881219
Ding LFu BFu YLu ZZhao Z(2010)O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum ProblemsFrontiers in Algorithmics10.1007/978-3-642-14553-7_24(250-261)Online publication date: 2010
https://doi.org/10.1007/978-3-642-14553-7_24
Batu TBerenbrink PSohler C(2009)A sublinear-time approximation scheme for bin packingTheoretical Computer Science10.1016/j.tcs.2009.08.006410:47-49(5082-5092)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.1016/j.tcs.2009.08.006
Asgeirsson EStein C(2009)Bounded-space online bin coverJournal of Scheduling10.1007/s10951-009-0116-x12:5(461-474)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1007/s10951-009-0116-x
Van Hentenryck PBent RUpfal E(2009)Online stochastic optimization under time constraintsAnnals of Operations Research10.1007/s10479-009-0605-5177:1(151-183)Online publication date: 18-Sep-2009
https://doi.org/10.1007/s10479-009-0605-5
Naaman NRom R(2008)Average Case Analysis of Bounded Space Bin Packing AlgorithmsAlgorithmica10.5555/3118787.311925850:1(72-97)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.5555/3118787.3119258
Bender MBradley BJagannathan GPillaipakkamnatt K(2008)Sum-of-squares heuristics for bin packing and memory allocationACM Journal of Experimental Algorithmics10.1145/1227161.122716512(1-19)Online publication date: 12-Jun-2008
https://dl.acm.org/doi/10.1145/1227161.1227165
Naaman NRom R(2007)Average Case Analysis of Bounded Space Bin Packing AlgorithmsAlgorithmica10.1007/s00453-007-9073-y50:1(72-97)Online publication date: 1-Dec-2007
https://doi.org/10.1007/s00453-007-9073-y
Asgeirsson EStein C(2006)Using markov chains to design algorithms for bounded-space on-line bin coverProceedings of the Meeting on Algorithm Engineering & Expermiments10.5555/2791171.2791179(75-85)Online publication date: 21-Jan-2006
https://dl.acm.org/doi/10.5555/2791171.2791179
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Modified subset sum heuristics for bin packing

Strip Packing vs. Bin Packing

Min-Sum Bin Packing

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Modified subset sum heuristics for bin packing

Strip Packing vs. Bin Packing

Min-Sum Bin Packing

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations