{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:16:40Z","timestamp":1751516200286,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_19","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"245-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Online Set Aggregation Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6511-5998","authenticated-orcid":false,"given":"Rodrigo A.","family":"Carrasco","sequence":"first","affiliation":[]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[]},{"given":"Cliff","family":"Stein","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Verschae","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"19_CR1","unstructured":"Bienkowski, M., B\u00f6hm, M., Byrka, J., Chrobak, M., D\u00fcrr, C., Folwarczn\u1ef3, L., Jez, L., Sgall, J., Thang, N.K., Vesel\u1ef3, P.: Online algorithms for multi-level aggregation. In: European Symposium on Algorithms, pp. 12:1\u201312:17 (2016)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Talmon, O.: O(depth)-competitive algorithm for online multi-level aggregation. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1235\u20131244 (2017)","DOI":"10.1137\/1.9781611974782.80"},{"key":"19_CR3","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1006\/jagm.1993.1026","volume":"14","author":"B Kalyanasundaram","year":"1993","unstructured":"Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478\u2013488 (1993)","journal-title":"J. Algorithms"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(94)90042-6","volume":"127","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theor. Comput. Sci. 127(2), 255\u2013267 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR6","unstructured":"Bienkowski, M., B\u00f6hm, M., Byrka, J., Chrobak, M., D\u00fcrr, C., Folwarczn\u1ef3, L., Je\u017c, L., Sgall, J., Thang, N.K., Vesel\u1ef3, P.: Online algorithms for multi-level aggregation. arXiv preprint arXiv:1507.02378 (2015)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1287\/opre.41.3.549","volume":"41","author":"A Aggarwal","year":"1993","unstructured":"Aggarwal, A., Park, J.K.: Improved algorithms for economic lot sizing problems. Oper. Res. 41, 549\u2013571 (1993)","journal-title":"Oper. Res."},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/375827.375843","volume":"48","author":"DR Dooly","year":"2001","unstructured":"Dooly, D.R., Goldman, S.A., Scott, S.D.: On-line analysis of the TCP acknowledgment delay problem. J. ACM 48(2), 243\u2013273 (2001)","journal-title":"J. ACM"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00453-003-1013-x","volume":"36","author":"AR Karlin","year":"2003","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP acknowledgement and other stories about e\/(e$$\\,-\\,$$1). Algorithmica 36(3), 209\u2013224 (2003)","journal-title":"Algorithmica"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Je\u017c, \u0141., Nogneng, D., Sgall, J.: Better approximation bounds for the joint replenishment problem. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 42\u201354 (2014)","DOI":"10.1137\/1.9781611973402.4"},{"key":"19_CR11","unstructured":"Buchbinder, N., Kimbrel, T., Levi, R., Makarychev, K., Sviridenko, M.: Online make-to-order joint replenishment model: primal-dual competitive algorithms. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 952\u2013961 (2008)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-39206-1_12","volume-title":"Automata, Languages, and Programming","author":"M Bienkowski","year":"2013","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Dobbs, N., Nowicki, T., Sviridenko, M., \u015awirszcz, G., Young, N.E.: Approximation algorithms for the joint replenishment problem with deadlines. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 135\u2013147. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_12"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Badrinath, B., Sudame, P.: Gathercast: the design and implementation of a programmable aggregation mechanism for the internet. In: International Conference on Computer Communications and Networks, pp. 206\u2013213 (2000)","DOI":"10.1109\/ICCCN.2000.885492"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Bortnikov, E., Cohen, R.: Schemes for scheduling of control messages by hierarchical protocols. In: Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 865\u2013872 (1998)","DOI":"10.1109\/INFCOM.1998.665111"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Hu, F., Cao, X., May, C.: Optimized scheduling for data aggregation in wireless sensor networks. In: International Conference on Information Technology: Coding and Computing (ITCC 2005), vol. 2, pp. 557\u2013561 (2005)","DOI":"10.1109\/ITCC.2005.219"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Yuan, W., Krishnamurthy, S., Tripathi, S.: Synchronization of multiple levels of data fusion in wireless sensor networks. In: Global Telecommunications Conference, vol. 1, pp. 221\u2013225 (2003)","DOI":"10.1109\/GLOCOM.2003.1258234"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/3-540-61680-2_82","volume-title":"Algorithms \u2014 ESA \u201996","author":"CH Papadimitriou","year":"1996","unstructured":"Papadimitriou, C.H.: Computational aspects of organization theory. In: Diaz, J., Serna, M. (eds.) ESA 1996. LNCS, vol. 1136, pp. 559\u2013564. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61680-2_82"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1287\/mnsc.20.1.14","volume":"20","author":"WB Crowston","year":"1973","unstructured":"Crowston, W.B., Wagner, M.H.: Dynamic lot size models for multi-stage assembly systems. Manag. Sci. 20(1), 14\u201321 (1973)","journal-title":"Manag. Sci."},{"key":"19_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-50162-3","volume-title":"Multi-level lot sizing and scheduling: methods for capacitated, dynamic, and deterministic models","author":"A Kimms","year":"1997","unstructured":"Kimms, A.: Multi-level lot sizing and scheduling: methods for capacitated, dynamic, and deterministic models. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-50162-3"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0019-8501(99)00113-3","volume":"29","author":"DM Lambert","year":"2000","unstructured":"Lambert, D.M., Cooper, M.C.: Issues in supply chain management. Ind. Mark. Manag. 29(1), 65\u201383 (2000)","journal-title":"Ind. Mark. Manag."},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/1644015.1644028","volume":"6","author":"L Becchetti","year":"2009","unstructured":"Becchetti, L., Marchetti-Spaccamela, A., Vitaletti, A., Korteweg, P., Skutella, M., Stougie, L.: Latency-constrained aggregation in sensor networks. ACM Trans. Algorithms 6(1), 13:1\u201313:20 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"19_CR22","unstructured":"Pedrosa, L.L.C.: Private communication (2013)"},{"issue":"2","key":"19_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/moor.1050.0178","volume":"31","author":"R Levi","year":"2006","unstructured":"Levi, R., Roundy, R., Shmoys, D.B.: Primal-dual algorithms for deterministic inventory problems. Mathematics of Operations Research 31(2), 267\u2013284 (2006)","journal-title":"Mathematics of Operations Research"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:29:29Z","timestamp":1751480969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}