{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:53:01Z","timestamp":1774417981429,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642380150","type":"print"},{"value":"9783642380167","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38016-7_3","type":"book-chapter","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T17:58:58Z","timestamp":1367344738000},"page":"16-29","source":"Crossref","is-referenced-by-count":12,"title":["Online Multi-Commodity Flow with High Demands"],"prefix":"10.1007","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Medina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/SFCS.1993.366884","volume-title":"FOCS 1993: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science","author":"B. Awerbuch","year":"1993","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: FOCS 1993: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science, pp. 32\u201340. IEEE Computer Society, Washington (1993)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.S.: Improved bounds for online routing and packing via a primal-dual approach. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 293\u2013304 (2006)","DOI":"10.1109\/FOCS.2006.39"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-25959-3_8","volume-title":"Distributed Computing and Networking","author":"G. Even","year":"2012","unstructured":"Even, G., Medina, M., Schaffrath, G., Schmid, S.: Competitive and deterministic embeddings of virtual networks. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds.) ICDCN 2012. LNCS, vol.\u00a07129, pp. 106\u2013121. Springer, Heidelberg (2012); CoRR abs\/1101.5221 (January 2011)"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM (JACM)\u00a044(3), 486\u2013504 (1997)","journal-title":"Journal of the ACM (JACM)"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jcss.1999.1662","volume":"62","author":"B. Awerbuch","year":"2001","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S., Waarts, O.: Competitive routing of virtual circuits with unknown duration. Journal of Computer and System Sciences\u00a062(3), 385\u2013397 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, N., Lee, K.W., Nagarajan, V., Zafer, M.: Minimum congestion mapping in a cloud. In: PODC, pp. 267\u2013276 (2011)","DOI":"10.1145\/1993806.1993854"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1287\/moor.1080.0363","volume":"34","author":"N. Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.S.: Online primal-dual algorithms for covering and packing. Math. Oper. Res.\u00a034(2), 270\u2013286 (2009)","journal-title":"Math. Oper. Res."},{"issue":"2-3","key":"3_CR8","first-page":"99","volume":"3","author":"N. Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.S.: The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science\u00a03(2-3), 99\u2013263 (2009)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.jcss.2005.05.002","volume":"71","author":"S. Kolliopoulos","year":"2005","unstructured":"Kolliopoulos, S., Young, N.: Approximation algorithms for covering\/packing integer programs. Journal of Computer and System Sciences\u00a071(4), 495\u2013505 (2005)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38016-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T15:13:32Z","timestamp":1557674012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38016-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642380150","9783642380167"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38016-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}