{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:06:41Z","timestamp":1766178401817},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_3","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T05:36:30Z","timestamp":1373520990000},"page":"25-36","source":"Crossref","is-referenced-by-count":14,"title":["Smart-Grid Electricity Allocation via Strip Packing with Slicing"],"prefix":"10.1007","author":[{"given":"Soroush","family":"Alamdari","sequence":"first","affiliation":[]},{"given":"Therese","family":"Biedl","sequence":"additional","affiliation":[]},{"given":"Timothy M.","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Elyot","family":"Grant","sequence":"additional","affiliation":[]},{"given":"Krishnam Raju","family":"Jampani","sequence":"additional","affiliation":[]},{"given":"Srinivasan","family":"Keshav","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"Vinayak","family":"Pathak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B.S. Baker","year":"1980","unstructured":"Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing\u00a09(4), 846\u2013855 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR2","series-title":"IFIP AICT","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-15240-5_23","volume-title":"Theoretical Computer Science","author":"M. Bougeret","year":"2010","unstructured":"Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., Trystram, D.: Approximating the non-contiguous multiple organization packing problem. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol.\u00a0323, pp. 316\u2013327. Springer, Heidelberg (2010)"},{"key":"3_CR3","first-page":"21","volume-title":"Handbook of Combinatorial Optimization","author":"B. Chen","year":"1998","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: complexity, algorithms and approximability. In: Handbook of Combinatorial Optimization, vol.\u00a03, pp. 21\u2013169. Kluwer Acad. Publ., Boston (1998)"},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E.G. Coffman Jr.","year":"1980","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput.\u00a09(4), 808\u2013826 (1980)","journal-title":"SIAM J. Comput."},{"key":"3_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman & Co. Ltd. (1979)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting-stock problem. Operations Res.\u00a09, 849\u2013859 (1961)","journal-title":"Operations Res."},{"key":"3_CR7","unstructured":"Giudice, P.: Our energy future and smart grid communications. Testimony before the FCC Field Hearing on Energy and Environment (2009), \n                  \n                    http:\/\/www.broadband.gov\/fieldevents\/fh_energy_environment\/giudice.pdf"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. Graham","year":"1969","unstructured":"Graham, R.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math.\u00a017, 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-642-22300-6_40","volume-title":"Algorithms and Data Structures","author":"R. Harren","year":"2011","unstructured":"Harren, R., Jansen, K., Pr\u00e4del, L., van Stee, R.: A (5\/3 + \u03b5)-approximation for strip packing. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 475\u2013487. Springer, Heidelberg (2011)"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. Assoc. Comput. Mach.\u00a034(1), 144\u2013162 (1987)","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-74456-6_11","volume-title":"Mathematical Foundations of Computer Science 2007","author":"K. Jansen","year":"2007","unstructured":"Jansen, K., Solis-Oba, R.: New approximability results for 2-dimensional packing problems. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 103\u2013114. Springer, Heidelberg (2007)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Symposium on Foundations of Computer Science, pp. 312\u2013320. IEEE (1982)","DOI":"10.1109\/SFCS.1982.61"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C. Kenyon","year":"2000","unstructured":"Kenyon, C., R\u00e9mila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res.\u00a025(4), 645\u2013656 (2000)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: A survey. European Journal of Operational Research\u00a0141(2), 241\u2013252 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S.K. Sahni","year":"1976","unstructured":"Sahni, S.K.: Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach.\u00a023(1), 116\u2013127 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BFb0049416","volume-title":"Algorithms - ESA \u201994","author":"I. Schiermeyer","year":"1994","unstructured":"Schiermeyer, I.: Reverse-Fit: A 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 290\u2013299. Springer, Heidelberg (1994)"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(80)90121-0","volume":"10","author":"D.D. Sleator","year":"1980","unstructured":"Sleator, D.D.: A 2.5 times optimal algorithm for packing in two dimensions. Information Processing Letters\u00a010(1), 37\u201340 (1980)","journal-title":"Information Processing Letters"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Srikantha, P., Rosenberg, C., Keshav, S.: An analysis of peak demand reductions due to elasticity of omestic appliances. In: Proc. Energy-Efficient Computing and Networking (e-Energy 2012), p. 28. ACM (2012)","DOI":"10.1145\/2208828.2208856"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing\u00a026(2), 401\u2013409 (1997)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:43:04Z","timestamp":1557945784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}