{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:57:41Z","timestamp":1725537461028},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_42","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"468-479","source":"Crossref","is-referenced-by-count":0,"title":["d-Dimensional Knapsack in the Streaming Model"],"prefix":"10.1007","author":[{"given":"Sumit","family":"Ganguly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Sohler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Khot, S., Sun, X.: Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. In: Proceedings of International Conference on Computational Complexity, pp. 107\u2013117 (2003)","DOI":"10.1109\/CCC.2003.1214414"},{"key":"42_CR2","unstructured":"Chekuri, C., Khanna, S.: On multi-dimensional packing problems. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 185\u2013194 (1999)"},{"key":"42_CR3","volume-title":"Graphentheorie","author":"R. Diestel","year":"2006","unstructured":"Diestel, R.: Graphentheorie. Springer, Heidelberg (2006)"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Ibarra, O.H., Kim, C.E.: Fast Approximation Algorithms for the Knapsack and the Sum of Subset Problems. J. ACM\u00a022(4) (October 1975)","DOI":"10.1145\/321906.321909"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Proc. of the 29th Intl. Conf. on Automata, Languages and Programming, pp. 293\u2013305 (2002)","DOI":"10.1007\/3-540-45465-9_26"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Iwama, K., Zhang, G.: Optimal Resource Augmentations for Online Knapsack. In: Proceedings of the 10th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 180\u2013188 (2007)","DOI":"10.1007\/978-3-540-74208-1_13"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among Combinatorial Problems. In: Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:35:14Z","timestamp":1552142114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}