{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:01:50Z","timestamp":1758272510744,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450457"},{"type":"electronic","value":"9783642450464"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45046-4_25","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:53:01Z","timestamp":1386593581000},"page":"305-318","source":"Crossref","is-referenced-by-count":10,"title":["Bicriteria Online Matching: Maximizing Weight and Cardinality"],"prefix":"10.1007","author":[{"given":"Nitish","family":"Korula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Zadimoghaddam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Agrawal, S., Wang, Z., Ye, Y.: A dynamic near-optimal algorithm for online linear programming. Working paper posted at \n                    http:\/\/www.stanford.edu\/~yyye\/"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Feldman, J., Mirrokni, V.S.: Online ad allocation with smooth delivery. In: ACM Conference on Knowledge Discovery, KDD (2012)","DOI":"10.1145\/2339530.2339720"},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.jpdc.2005.07.006","volume":"66","author":"V. Bil\u00f2","year":"2006","unstructured":"Bil\u00f2, V., Flammini, M., Moscardelli, L.: Pareto approximations for the bicriteria scheduling problem. Journal of Parallel and Distributed Computing\u00a066(3), 393\u2013402 (2006)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"25_CR4","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. SIGACT News\u00a039(1), 80\u201387 (2008)","journal-title":"SIGACT News"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Jain, K., Naor, J.(S.): Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 253\u2013264. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-75520-3_24"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.: Fair online load balancing. In: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 291\u2013298. ACM (2006)","DOI":"10.1145\/1148109.1148159"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Devanur, N., Hayes, T.: The adwords problem: Online keyword matching with budgeted bidders under random permutations. In: ACM EC (2009)","DOI":"10.1145\/1566374.1566384"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K., Sivan, B., Wilkens, C.A.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In: ACM Conference on Electronic Commerce, pp. 29\u201338 (2011)","DOI":"10.1145\/1993574.1993581"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Sivan, B., Azar, Y.: Asymptotically optimal algorithm for stochastic adwords. In: ACM Conference on Electronic Commerce, pp. 388\u2013404 (2012)","DOI":"10.1145\/2229012.2229043"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15775-2_16","volume-title":"Algorithms \u2013 ESA 2010","author":"J. Feldman","year":"2010","unstructured":"Feldman, J., Henzinger, M., Korula, N., Mirrokni, V.S., Stein, C.: Online stochastic packing applied to display ad allocation. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 182\u2013194. Springer, Heidelberg (2010)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-10841-9_34","volume-title":"Internet and Network Economics","author":"J. Feldman","year":"2009","unstructured":"Feldman, J., Korula, N., Mirrokni, V., Muthukrishnan, S., P\u00e1l, M.: Online ad assignment with free disposal. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 374\u2013385. Springer, Heidelberg (2009)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: Beating 1 - 1\/e. In: FOCS (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-45253-2_18","volume-title":"Algorithms - ESA 2000","author":"M. Flammini","year":"2000","unstructured":"Flammini, M., Nicosia, G.: On multicriteria online problems. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 191\u2013201. Springer, Heidelberg (2000)"},{"key":"25_CR14","unstructured":"Goel, A., Meyerson, A., Plotkin, S.: Approximate majorization and fair online load balancing. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 384\u2013390. Society for Industrial and Applied Mathematics (2001)"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1006\/jcss.2001.1755","volume":"63","author":"A. Goel","year":"2001","unstructured":"Goel, A., Meyerson, A., Plotkin, S.: Combining fairness with throughput: Online routing with multiple objectives. Journal of Computer and System Sciences\u00a063(1), 62\u201379 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Mirrokni, V.S., Zadimoghaddam, M.: Online stochastic weighted matching: Improved approximation algorithms. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol.\u00a07090, pp. 170\u2013181. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-25510-6_15"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: STOC (2011)","DOI":"10.1145\/1993636.1993715"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: STOC, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"25_CR19","unstructured":"Korula, N., Mirrokni, V.S., Yan, Q.: Whole-page ad allocation and. In: Ad Auctions Workshop (2012)"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: A strongly factor revealing lp approach. In: STOC (2011)","DOI":"10.1145\/1993636.1993716"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U.V., Vazirani, V.V.: Adwords and generalized online matching. J. ACM\u00a054(5) (2007)","DOI":"10.1145\/1284320.1284321"},{"key":"25_CR22","unstructured":"Menshadi, H., OveisGharan, S., Saberi, A.: Offline optimization for online stochastic matching. In: SODA (2011)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Mirrokni, V., Gharan, S.O., ZadiMoghaddam, M.: Simultaneous approximations for adversarial and stochastic online budgeted allocation problems. In: SODA (2012)","DOI":"10.1137\/1.9781611973099.134"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Vee, E., Vassilvitskii, S., Shanmugasundaram, J.: Optimal online assignment with forecasts. In: ACM EC (2010)","DOI":"10.1145\/1807342.1807360"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-01671-4_21","volume-title":"Advances in Grid and Pervasive Computing","author":"C.-M. Wang","year":"2009","unstructured":"Wang, C.-M., Huang, X.-W., Hsu, C.-C.: Bi-objective optimization: An online algorithm for job assignment. In: Abdennadher, N., Petcu, D. (eds.) GPC 2009. LNCS, vol.\u00a05529, pp. 223\u2013234. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45046-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T21:01:57Z","timestamp":1675976517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45046-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450457","9783642450464"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45046-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}