{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:00:28Z","timestamp":1725552028796},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340218"},{"type":"electronic","value":"9783540340225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_10","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T02:11:16Z","timestamp":1146708676000},"page":"108-117","source":"Crossref","is-referenced-by-count":0,"title":["A Bounded Item Bin Packing Problem over Discrete Distribution"],"prefix":"10.1007","author":[{"given":"Jianxin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yuhang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"E.G. Coffman","year":"1996","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46\u201393. PSW publishing, Boston (1996)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","volume":"39","author":"M. Laguna","year":"1993","unstructured":"Laguna, M., Glover, F.: Bandwidth packing: A tabu search approach. Management Science\u00a039, 492\u2013500 (1993)","journal-title":"Management Science"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1287\/mnsc.42.9.1277","volume":"42","author":"K. Park","year":"1996","unstructured":"Park, K., Kang, S., Park, S.: An integer programming approach to the bandwidth packing problem. Management Science\u00a042, 1277\u20131291 (1996)","journal-title":"Management Science"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF02109857","volume":"2","author":"M. Parker","year":"1995","unstructured":"Parker, M., Ryan, J.: A column generation algorithm for bandwidth packing. Telecommunication Systems\u00a02, 185\u2013196 (1995)","journal-title":"Telecommunication Systems"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0305-0548(99)00004-0","volume":"27","author":"A. Ali","year":"2000","unstructured":"Ali, A., Barkhi, R.: The Multi-Hour Bandwidth Packing Problem. Computers and OR\u00a027, 1\u201314 (2000)","journal-title":"Computers and OR"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Coffman Jr., E.G., Feldmann, A., Kahale, N., Poonen, B.: Computing Call Admission Capacities in Linear Networks. Prob. Eng. Inf. Sci., 387\u2013406 (1999)","DOI":"10.1017\/S0269964899134016"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF02679614","volume":"29","author":"E.G. Coffman Jr.","year":"2001","unstructured":"Coffman Jr., E.G., Stolyar, A.L.: Bandwidth Packing. Algorithmica\u00a029, 70\u201388 (2001)","journal-title":"Algorithmica"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TCOM.1980.1094702","volume":"28","author":"H. Zimmermann","year":"1980","unstructured":"Zimmermann, H.: OSI Reference Model - The ISO Model of Architecture for Open Systems Interconnection. IEEE Transactions on Communication\u00a028(4), 425\u2013432 (1980)","journal-title":"IEEE Transactions on Communication"},{"key":"10_CR9","volume-title":"Internetworking with TCP\/IP","author":"D. Comer","year":"1988","unstructured":"Comer, D.: Internetworking with TCP\/IP. Prentice Hall, Englewood Cliffs (1988)"},{"key":"10_CR10","unstructured":"Why Modern Switch Fabrics use a Fixed-Size Frame Format, whitepaper (2005)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0019-9958(80)90050-9","volume":"44","author":"E. Coffman Jr.","year":"1980","unstructured":"Jr. Coffman, E., So, K., Hofri, M., Yao, A.: A stochasitic model of Bin-Packing. Information and Control\u00a044, 105\u2013115 (1980)","journal-title":"Information and Control"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: Probability analysis of some bin packing algorithms. In: Proceedings of the 23rd Annual symposium on foundations of Computer Science, pp. 107\u2013111 (1982)","DOI":"10.1109\/SFCS.1982.37"},{"key":"10_CR13","unstructured":"Tsuga, K.: Average-case Analysis of On-line Bin Packing Algorithms, Masters Thesis, Dept. of Computer-Scienece, Univ. of California, Santa Barbara, CA (1986)"},{"issue":"5","key":"10_CR14","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1109\/18.259640","volume":"39","author":"E.G. Coffman Jr.","year":"1993","unstructured":"Coffman Jr., E.G., Halfin, S., Jean-Marie, A., Robert, P.: Stochastic analysis of a slotted FIFO communication channel. IEEE Trans. on Info. Theory\u00a039(5), 1555\u20131566 (1993)","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10_CR15","first-page":"139","volume":"4","author":"N. Menakerman","year":"2001","unstructured":"Menakerman, N., Rom, R.: Analysis of Transmissions Scheduling with Packet Fragmentation. Discrete Mathematics and Theoretical Computer Science\u00a04, 139\u2013156 (2001)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1137\/S0895480197325936","volume":"13","author":"E.G. Coffman Jr.","year":"2000","unstructured":"Coffman Jr., E.G., Courcoubetis, C., Garey, M.R., Johnson, D.S., Shor, P.W., Weber, R.R., Yannakakis, M.: Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. SIAM J. Discrete Mathematics\u00a013, 384\u2013402 (2000)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.12.1.177","volume":"12","author":"T. Rhee","year":"1987","unstructured":"Rhee, T., Talagrand, M.: Martingale inequalities and NP-complete problems. Mathematical Operations Research\u00a012, 177\u2013181 (1987)","journal-title":"Mathematical Operations Research"},{"key":"10_CR18","volume-title":"Probabilistic Analysis of Packing and Partitioning Algorithms","author":"E.G. Coffman Jr.","year":"1991","unstructured":"Coffman Jr., E.G., Lueker, G.S.: Probabilistic Analysis of Packing and Partitioning Algorithms. Wiley, New York (1991)"},{"key":"10_CR19","unstructured":"Menakerman, N., Rom, R.: Average Case Analysis of Bounded Space Bin Packing Algorithms, EE Publication No.1274 (2000)"},{"key":"10_CR20","first-page":"205","volume-title":"Introductory combinatorics","author":"R.A. Brualdi","year":"1999","unstructured":"Brualdi, R.A.: Introductory combinatorics, 3rd edn., pp. 205\u2013208. Prentice Hall, Englewood Cliffs (1999)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11750321_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:56:21Z","timestamp":1619492181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11750321_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}