{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:16Z","timestamp":1725795136230},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_22","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T04:18:07Z","timestamp":1401423487000},"page":"240-251","source":"Crossref","is-referenced-by-count":3,"title":["Near Optimal Algorithms for Online Maximum Weighted b-Matching"],"prefix":"10.1007","author":[{"given":"Hingfung","family":"Ting","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangzhong","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1253\u20131264. SIAM (2011)","DOI":"10.1137\/1.9781611973082.95"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-15775-2_15","volume-title":"Algorithms \u2013 ESA 2010","author":"B. Bahmani","year":"2010","unstructured":"Bahmani, B., Kapralov, M.: Improved bounds for online stochastic matching. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 170\u2013181. Springer, Heidelberg (2010)"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/1360443.1360462","volume":"39","author":"B. Birnbaum","year":"2008","unstructured":"Birnbaum, B., Mathieu, C.: On-line bipartite matching made simple. ACM SIGACT News\u00a039(1), 80\u201387 (2008)","journal-title":"ACM SIGACT News"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Hubert Chan, T.-H., Chen, F., Wu, X., Zhao, Z.: Ranking on arbitrary graphs: Rematch via continuous lp with monotone and boundary condition constraints. In: SODA, pp. 1112\u20131122 (2014)","DOI":"10.1137\/1.9781611973402.82"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K., Kleinberg, R.D.: Randomized primal-dual analysis of ranking for online bipartite matching. In: SODA, pp. 101\u2013107. SIAM (2013)","DOI":"10.1137\/1.9781611973105.7"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: Beating 1-1\/e. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 117\u2013126. IEEE (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"22_CR7","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 982\u2013991. Society for Industrial and Applied Mathematics (2008)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-25510-6_15","volume-title":"Internet and Network Economics","author":"B. Haeupler","year":"2011","unstructured":"Haeupler, B., Mirrokni, V.S., Zadimoghaddam, M.: Online stochastic weighted matching: Improved approximation algorithms. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) Internet and Network Economics. LNCS, vol.\u00a07090, pp. 170\u2013181. Springer, Heidelberg (2011)"},{"issue":"3","key":"22_CR9","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\u00a014(3), 478\u2013488 (1993)","journal-title":"J. Algorithms"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(99)00140-1","volume":"233","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.R.: An optimal deterministic algorithm for online b-matching. Theoretical Computer Science\u00a0233(1), 319\u2013325 (2000)","journal-title":"Theoretical Computer Science"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 587\u2013596. ACM (2011)","DOI":"10.1145\/1993636.1993715"},{"key":"22_CR12","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 Twenty-second Annual ACM Symposium on Theory of Computing, pp. 352\u2013358. ACM (1990)","DOI":"10.1145\/100216.100262"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-02930-1_42","volume-title":"Automata, Languages and Programming","author":"N. Korula","year":"2009","unstructured":"Korula, N., P\u00e1l, M.: Algorithms for secretary problems on graphs and hypergraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 508\u2013520. Springer, Heidelberg (2009)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing lps. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 597\u2013606. ACM (2011)","DOI":"10.1145\/1993636.1993716"},{"issue":"4","key":"22_CR15","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1287\/moor.1120.0551","volume":"37","author":"V.H. Manshadi","year":"2012","unstructured":"Manshadi, V.H., Gharan, S.O., Saberi, A.: Online stochastic matching: Online actions based on offline statistics. Mathematics of Operations Research\u00a037(4), 559\u2013573 (2012)","journal-title":"Mathematics of Operations Research"},{"issue":"5","key":"22_CR16","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1284320.1284321","volume":"54","author":"A. Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. Journal of the ACM (JACM)\u00a054(5), 22 (2007)","journal-title":"Journal of the ACM (JACM)"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: Toward a unified measure of complexity. In: 18th Annual Symposium on Foundations of Computer Science, pp. 222\u2013227 (October 1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:26:22Z","timestamp":1558913182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}