{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:54:57Z","timestamp":1725738897483},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392054"},{"type":"electronic","value":"9783642392061"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39206-1_12","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T17:20:16Z","timestamp":1372785616000},"page":"135-147","source":"Crossref","is-referenced-by-count":4,"title":["Approximation Algorithms for the Joint Replenishment Problem with Deadlines"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslaw","family":"Byrka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil","family":"Dobbs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Nowicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"\u015awirszcz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neal E.","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science\u00a0237(1-2), 123\u2013134 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(89)90001-1","volume":"8","author":"E. Arkin","year":"1989","unstructured":"Arkin, E., Joneja, D., Roundy, R.: Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters\u00a08(2), 61\u201366 (1989)","journal-title":"Operations Research Letters"},{"issue":"1","key":"12_CR3","doi-asserted-by":"crossref","first-page":"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 Transactions on Algorithms\u00a06(1), 13:1\u201313:20 (2009)","journal-title":"ACM Transactions on Algorithms"},{"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. CoRR abs\/1212.3233v2 (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1212.3233v2","key":"12_CR4"},{"unstructured":"Brito, C., Koutsoupias, E., Vaya, S.: Competitive analysis of organization networks or multicast acknowledgement: How much to wait? In: Proc. of the 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 627\u2013635 (2004)","key":"12_CR5"},{"unstructured":"Buchbinder, N., Kimbrel, T., Levi, R., Makarychev, K., Sviridenko, M.: Online make-to-order joint replenishment model: Primal dual competitive algorithms. In: Proc. of the 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 952\u2013961 (2008)","key":"12_CR6"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45465-9_13","volume-title":"Automata, Languages and Programming","author":"S. Khanna","year":"2002","unstructured":"Khanna, S., Naor, J.(S.), Raz, D.: Control message aggregation in group communication protocols. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 135\u2013146. Springer, Heidelberg (2002)"},{"unstructured":"Levi, R., Roundy, R., Shmoys, D.B.: A constant approximation algorithm for the one-warehouse multi-retailer problem. In: Proc. of the 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 365\u2013374 (2005)","key":"12_CR8"},{"issue":"2","key":"12_CR9","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\u00a031(2), 267\u2013284 (2006)","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1287\/mnsc.1070.0781","volume":"54","author":"R. Levi","year":"2008","unstructured":"Levi, R., Roundy, R., Shmoys, D.B., Sviridenko, M.: A constant approximation algorithm for the one-warehouse multiretailer problem. Management Science\u00a054(4), 763\u2013776 (2008)","journal-title":"Management Science"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/11830924_19","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"R. Levi","year":"2006","unstructured":"Levi, R., Sviridenko, M.: Improved approximation algorithm for the one-warehouse multi-retailer problem. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 188\u2013199. Springer, Heidelberg (2006)"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1142\/S1793830909000130","volume":"1","author":"T. Nonner","year":"2009","unstructured":"Nonner, T., Souza, A.: Approximating the joint replenishment problem with deadlines. Discrete Mathematics, Algorithms and Applications\u00a01(2), 153\u2013174 (2009)","journal-title":"Discrete Mathematics, Algorithms and Applications"}],"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-642-39206-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:38:27Z","timestamp":1557913107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39206-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392054","9783642392061"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39206-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}