{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:56:58Z","timestamp":1761807418597},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_20","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T04:38:35Z","timestamp":1207197515000},"page":"228-239","source":"Crossref","is-referenced-by-count":12,"title":["The Online Transportation Problem: On the Exponential Boost of One Extra Server"],"prefix":"10.1007","author":[{"given":"Christine","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patchrawat","family":"Uthaisombut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: ACM Symposium on Theory of Computing, pp. 161\u2013168 (1998)","DOI":"10.1145\/276698.276725"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Symposium on Foundations of Computer Science, p. 379 (1998)","DOI":"10.1109\/SFCS.1998.743488"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Csaba, B., Pluhar, A.: A randomized algorithm for the on-line weighted bipartite matching problem. Journal of Scheduling (to appear)","DOI":"10.1007\/s10951-007-0037-5"},{"issue":"3","key":"20_CR4","first-page":"485","volume":"69","author":"J. Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences Special Issue on STOC 2003\u00a069(3), 485\u2013497 (2004)","journal-title":"Journal of Computer and System Sciences Special Issue on STOC 2003"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hajiaghayi, M.T., R\u00e4cke, H.: Oblivious network design. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 970\u2013979 (2006)","DOI":"10.1145\/1109557.1109665"},{"issue":"3","key":"20_CR6","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. Journal of Algorithms\u00a014(3), 478\u2013488 (1993)","journal-title":"Journal of Algorithms"},{"key":"20_CR7","first-page":"268","volume-title":"Developments from a June 1996 seminar on Online Algorithms","author":"B. Kalyanasundaram","year":"1998","unstructured":"Kalyanasundaram, B., Pruhs, K.: On-line network optimization problems. In: Developments from a June 1996 seminar on Online Algorithms, pp. 268\u2013280. Springer, Heidelberg (1998)"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1137\/S0895480198342310","volume":"13","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.R.: The online transportation problem. SIAM Journal of Discrete Mathematics\u00a013(3), 370\u2013383 (2000)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"20_CR9","volume-title":"Algorithms for Network Programming","author":"J.L. Kennington","year":"1980","unstructured":"Kennington, J.L., Helgason, R.V.: Algorithms for Network Programming. John Wiley & Sons, Inc., New York, NY, USA (1980)"},{"issue":"2","key":"20_CR10","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. Theoretical Computer Science\u00a0127(2), 255\u2013267 (1994)","journal-title":"Theoretical Computer Science"},{"key":"20_CR11","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"1976","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart & Winston, New York (1976)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Nanavati, A., Poplawski, L.: Randomized online algorithms for minimum metric bipartite matching. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 954\u2013959 (2006)","DOI":"10.1145\/1109557.1109662"}],"container-title":["Lecture Notes in Computer Science","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:21:33Z","timestamp":1619508093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_20","relation":{},"subject":[]}}