{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:18Z","timestamp":1759638498993},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210795"},{"type":"electronic","value":"9783540245926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24592-6_14","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:13:33Z","timestamp":1280387613000},"page":"179-191","source":"Crossref","is-referenced-by-count":21,"title":["The Online Matching Problem on a Line"],"prefix":"10.1007","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]},{"given":"Akash","family":"Nanavati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R.A. Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Information and Computation\u00a0106(2), 234\u2013252 (1993)","journal-title":"Information and Computation"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards B\u00a069B, 125\u2013130 (1965)","journal-title":"Journal of Research of the National Bureau of Standards B"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"key":"14_CR4","volume-title":"Electronic Notes in Discrete Mathematics","author":"B. Fuchs","year":"2003","unstructured":"Fuchs, B., Hochst\u00e4ttler, W., Kern, W.: Online matching on a line. In: Broersma, H., Faigle, U., Hurink, J., Pickl, S., Woeginger, G. (eds.) Electronic Notes in Discrete Mathematics, vol.\u00a013, Elsevier, Amsterdam (2003)"},{"issue":"3","key":"14_CR5","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); A Preliminary version appeared in the proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, pp. 234\u2013240 (1991)","journal-title":"Journal of Algorithms"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0029573","volume-title":"Online Algorithms","author":"B. Kalyanasundaram","year":"1998","unstructured":"Kalyanasundaram, B., Pruhs, K.: Online network optimization problems. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms. LNCS, vol.\u00a01442, pp. 268\u2013280. Springer, Heidelberg (1998)"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1137\/S0895480198342310","volume":"13","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Online transportation problem. SIAM Journal of Discrete Mathematics\u00a013(3), 370\u2013383 (2000); A Preliminary version appeared in Proceedings of the European Symposium on Algorithms, pp. 484\u2013493 (1995)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the 22nd ACM Annual Symposium on Theory of computing, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"14_CR9","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, 255\u2013267 (1994); A preliminary version appeared as Technical Report 90\u20131143, Department of Computer Science, Cornell University (1990)","journal-title":"Theoretical Computer Science"},{"key":"14_CR10","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Elsevier Science Pub. Co., Amsterdam (1986)"}],"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-540-24592-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T14:45:38Z","timestamp":1552833938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24592-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210795","9783540245926"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24592-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}