SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 44, Issue 1, 2002, Pages 95-108

Perfect packing theorems and the average-case behavior of optimal and online bin packing

(7) Coffman Jr , E G a Courcoubetis, C a Garey, M R a Johnson, D S a Shor, P W a Weber, R R a Yannakakis, M a

a Och Spine at New York Presbyterian Hospitals (United States)

Author keywords

Approximation algorithms; Average case analysis; Bin packing; Online

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; ONE DIMENSIONAL; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SET THEORY;

AVERAGE-CASE ANALYSIS; ONLINE BIN PACKING; PERFECT PACKING THEOREMS;

THEOREM PROVING;

EID: 0036494305 PISSN: 00361445 EISSN: None Source Type: Journal
DOI: 10.1137/S0036144501395423 Document Type: Article

Times cited : (19)

References (27)

1
- 0032256755
- Average-case analysis of first fit and random fit bin packing
- Proceedings of 9th ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1998 , pp. 290-299
- Albers, S.¹ Mitzenmacher, M.²

2
- 0021000579
- An experimental study of bin packing
- Proceedings of the 21st Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, Urbana, 1983 , pp. 51-60
- Bentley, J.L.¹ Johnson, D.S.² Leighton, F.T.³ McGeoch, C.C.⁴

3
- 85031941632
- Some unexpected expected behavior results for bin packing
- ACM Press, New York
- (1984) Proceedings of the 16th Annual ACM Symposium on Theory of Computing , pp. 279-288
- Bentley, J.L.¹ Johnson, D.S.² Leighton, F.T.³ McGeoch, C.C.⁴ McGeoch, L.A.⁵

4
- 84985066910
- Fundamental discrepancies between average-case analyses under discrete and continuous distributions
- ACM Press, New York
- (1991) Proceedings of the 23rd Annual ACM Symposium on Theory of Computing , pp. 230-240
- Coffman E.G., Jr.¹ Courcoubetis, C.² Garey, M.R.³ Johnson, D.S.⁴ McGeoch, L.A.⁵ Shor, P.W.⁶ Weber, R.R.⁷ Yannakakis, M.⁸

5

6

7

8
- 0027150672
- Markov chains, computer proofs, and average-case analysis of Best Fit bin packing
- ACM Press, New York
- (1993) Proceedings of the 25th Annual ACM Symposium on Theory of Computing , pp. 412-421
- Coffman E.G., Jr.¹ Johnson, D.S.² Shor, P.W.³ Weber, R.R.⁴

9
- 0031538003
- Bin packing with discrete item sizes, Part II: Tight bounds on first fit
- (1997) Random Structures Algorithms , vol.10 , pp. 69-101
- Coffman E.G., Jr.¹ Johnson, D.S.² Shor, P.W.³ Weber, R.R.⁴

10
- 0003947469
- Wiley, New York
- (1991) An Introduction to the Probabilistic Analysis of Packing and Partioning Algorithms
- Coffman E.G., Jr.¹ Lueker, G.S.²

11
- 84974125614
- Stability of on-line bin packing with random arrivals and long-run average constraints
- (1990) Probab. Engrg. Inform. Sci. , vol.4 , pp. 447-460
- Courcoubetis, C.¹ Weber, R.R.²

12
- 0033715163
- On the sum-of-squares algorithm for bin packing
- ACM Press, New York
- (2000) Proceedings of the 32nd ACM Symposium on Theory of Computing , pp. 208-217
- Csirik, J.¹ Johnson, D.S.² Kenyon, C.³ Orlin, J.B.⁴ Shor, P.⁵ Weber, R.R.⁶

13
- 0003603813
- W. H. Freeman, New York
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

14
- 0003622855
- Ph.D. thesis, Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA
- (1973) Near-Optimal Bin Packing Algorithms
- Johnson, D.S.¹

15
- 0000339680
- Worst-case performance bounds for simple one-dimensional packing algorithms
- (1974) SIAM J. Comput. , vol.3 , pp. 299-325
- Johnson, D.S.¹ Demers, A.² Ullman, J.D.³ Garey, M.R.⁴ Graham, R.L.⁵

16

17
- 0020252446
- An efficient approximation scheme for the one-dimensional bin packing problem
- IEEE Computer Society Press, Los Alamitos, CA
- (1982) Proceedings of the 23rd Annual Symposium on Foundations of Computer Science , pp. 312-320
- Karmarkar, N.¹ Karp, R.M.²

18
- 0034498376
- Linear waste of best fit bin packing on skewed distributions
- IEEE Computer Society Press, Los Alamitos, CA
- (2000) Proceedings of the 41st Annual Symposium on Foundations of Computer Science , pp. 582-589
- Kenyon, C.¹ Mitzenmacher, M.²

19
- 0001560625
- Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing
- (1998) J. Algorithms , vol.27 , pp. 218-235
- Kenyon, C.¹ Rabani, Y.² Sinclair, A.³

20
- 85031920446
- A bin packing algorithm with complexity o(nlogn) in the stochastic limit
- J. Gruska and M. Chytil, eds., Lecture Notes in Comput. Sci. 118, Springer-Verlag, Berlin
- (1981) Proceedings of the 10th Symposium on Mathematical Foundations of Computer Science , pp. 369-378
- Knödel, W.¹

21
- 0006187724
- Tech. Report 181, Department of Information and Computer Science, University of California, Irvine, CA
- (1982) An Average-Case Analysis of Bin Packing with Uniformly Distributed Item Sizes
- Lueker, G.S.¹

22
- 0006243391
- Optimal bin packing with items of random sizes
- (1988) Math. Oper. Res. , vol.13 , pp. 140-151
- Rhee, W.T.¹

23
- 0024680501
- Optimal bin packing with items of random sizes
- (1989) III, SIAM J. Comput. , vol.18 , pp. 473-486
- Rhee, W.T.¹ Talagrand, M.²

24
- 0006262885
- On-line bin packing with items of random sizes
- (1993) Math. Oper. Res. , vol.18 , pp. 438-445
- Rhee, W.T.¹ Talagrand, M.²

25
- 0027843637
- On-line bin packing of items of random sizes
- (1993) II, SIAM J. Comput. , vol.22 , pp. 1251-1256
- Rhee, W.T.¹ Talagrand, M.²

26
- 51249179448
- The average case analysis of some on-line algorithms for bin packing
- (1986) Combinatorica , vol.6 , pp. 179-200
- Shor, P.W.¹

27
- 0026385076
- How to pack better than best fit: Tight bounds for average-case on-line bin packing
- IEEE Computer Society Press, Los Alamitos, CA
- (1991) Proceedings of the 32nd Annual Symposium on Foundations of Computer Science , pp. 752-759
- Shor, P.W.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.