{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:36Z","timestamp":1746331416869,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_6","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"64-76","source":"Crossref","is-referenced-by-count":4,"title":["Time-Expanded Packings"],"prefix":"10.1007","author":[{"given":"David","family":"Adjiashvili","sequence":"first","affiliation":[]},{"given":"Sandro","family":"Bosio","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[]},{"given":"Rico","family":"Zenklusen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V.V., Marchetti-Spaccamela, M., Protasi, M.: Complexity and Approximation. Springer (1999)","key":"6_CR1","DOI":"10.1007\/978-3-642-58412-1"},{"doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J.S., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J.\u00a0ACM, 735\u2013744 (2000)","key":"6_CR2","DOI":"10.1145\/335305.335410"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31","author":"A. Bar-Noy","year":"2002","unstructured":"Bar-Noy, A., Guha, S.: Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput.\u00a031, 331\u2013352 (2002)","journal-title":"SIAM J. Comput."},{"key":"6_CR4","first-page":"178","volume":"7","author":"P. Berman","year":"2000","unstructured":"Berman, P.: A d\/2 approximation for maximum weight independent set in d-claw free graphs. Nordic J. of Computing\u00a07, 178\u2013184 (2000)","journal-title":"Nordic J. of Computing"},{"doi-asserted-by":"crossref","unstructured":"Caprara, A.: Packing 2-dimensional bins in harmony. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, FOCS 2002, pp. 490\u2013499 (2002)","key":"6_CR5","DOI":"10.1109\/SFCS.2002.1181973"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1287\/mnsc.12.1.122","volume":"12","author":"R.J. Duffin","year":"1965","unstructured":"Duffin, R.J., Karlovitz, L.A.: An infinite linear program with a duality gap. Management Science\u00a012(1), 122\u2013134 (1965)","journal-title":"Management Science"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research\u00a06(3), 419\u2013433 (1958)","journal-title":"Operations Research"},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A guide to the theory of NP-completeness. W.H. Freeman and Co. (1979)","key":"6_CR8"},{"key":"6_CR9","first-page":"463","volume":"22","author":"O.H. Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J.\u00a0ACM\u00a022, 463\u2013468 (1975)","journal-title":"J.\u00a0ACM"},{"unstructured":"Jansen, K., Zhang, G.: On rectangle packing: maximizing benefits. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 204\u2013213 (2004)","key":"6_CR10"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00186-011-0357-2","volume":"73","author":"R. Koch","year":"2011","unstructured":"Koch, R., Nasrabadi, E., Skutella, M.: Continuous and discrete flows over time: A general model based on measure theory. Mathematical Methods Of Operations Research\u00a073(3), 301\u2013337 (2011)","journal-title":"Mathematical Methods Of Operations Research"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-6377(92)90065-B","volume":"12","author":"R. Kohli","year":"1992","unstructured":"Kohli, R., Krishnamurti, R.: A total-value greedy heuristic for the integer knapsack problem. Operations Research Letters\u00a012(2), 65\u201371 (1992)","journal-title":"Operations Research Letters"},{"doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: Fast approximation algorithms for knapsack problems. In: Proceedings of the 18th Symposium on Foundations of Computer Science, FOCS 1977, pp. 206\u2013213 (1977)","key":"6_CR13","DOI":"10.1109\/SFCS.1977.11"},{"key":"6_CR14","first-page":"562","volume":"32","author":"C.C. Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. J.\u00a0ACM\u00a032, 562\u2013572 (1985)","journal-title":"J.\u00a0ACM"},{"unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)","key":"6_CR15"},{"unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms and Systems, 3rd edn. Springer (2008)","key":"6_CR16"},{"unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer (2003)","key":"6_CR17"},{"doi-asserted-by":"crossref","unstructured":"Skutella, M.: An introduction to network flows over time. Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer (2009)","key":"6_CR18","DOI":"10.1007\/978-3-540-76796-1_21"},{"unstructured":"Sloane, N.J.A.: Sequences A000058 and A007018. The On-Line Encyclopedia of Integer Sequences, http:\/\/oeis.org","key":"6_CR19"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:31:24Z","timestamp":1746264684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}