{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:35Z","timestamp":1750306955934,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,22]]},"DOI":"10.1145\/2463676.2465321","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"845-856","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["On optimal worst-case matching"],"prefix":"10.1145","author":[{"given":"Cheng","family":"Long","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"given":"Raymond Chi-Wing","family":"Wong","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, Chicago, IL, USA"}]},{"given":"Minhao","family":"Jiang","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"hong kong: Performance pledge","author":"Fire","year":"2012","unstructured":"Fire services department , hong kong: Performance pledge 2012 . http:\/\/www.hkfsd.gov.hk\/eng\/performance.html. Fire services department, hong kong: Performance pledge 2012. http:\/\/www.hkfsd.gov.hk\/eng\/performance.html."},{"key":"e_1_3_2_1_2_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993","unstructured":"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin . Network Flows: Theory, Algorithms, and Applications . Prentice Hall , 1993 . R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993."},{"key":"e_1_3_2_1_3_1","volume-title":"Networks","author":"Bortnikov E.","year":"2010","unstructured":"E. Bortnikov , S. Khuller , J. Li , Y. Mansour , and J. S. Naor . The load-distance balancing problem . Networks , 2010 . E. Bortnikov, S. Khuller, J. Li, Y. Mansour, and J. S. Naor. The load-distance balancing problem. Networks, 2010."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1508120"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758842"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80030-4"},{"key":"e_1_3_2_1_7_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to algorithms . 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28076-4_9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0016-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00096-X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90031-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040572.2040623"},{"key":"e_1_3_2_1_14_1","volume-title":"The bottleneck assignment problem","author":"Gross O.","year":"1959","unstructured":"O. Gross . The bottleneck assignment problem . The Rand Corporation , 1959 . O. Gross. The bottleneck assignment problem. The Rand Corporation, 1959."},{"key":"e_1_3_2_1_15_1","volume-title":"A best possible heuristic for the k-center problem. Mathematics of operations research","author":"Hochbaum D. S.","year":"1985","unstructured":"D. S. Hochbaum and D. B. Shmoys . A best possible heuristic for the k-center problem. Mathematics of operations research , 1985 . D. S. Hochbaum and D. B. Shmoys. A best possible heuristic for the k-center problem. Mathematics of operations research, 1985."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367926"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335415"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465321"},{"key":"e_1_3_2_1_20_1","volume-title":"Postal code conversion file (pccf). In http:\/\/www5.statcan.gc.ca\/bsolc\/olc-cel\/olc-cel?lang=eng&catno=92F0153X","author":"Canada Statistics","year":"2012","unstructured":"Statistics Canada . Postal code conversion file (pccf). In http:\/\/www5.statcan.gc.ca\/bsolc\/olc-cel\/olc-cel?lang=eng&catno=92F0153X , 2012 . Statistics Canada. Postal code conversion file (pccf). In http:\/\/www5.statcan.gc.ca\/bsolc\/olc-cel\/olc-cel?lang=eng&catno=92F0153X, 2012."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0144-3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376621"},{"key":"e_1_3_2_1_23_1","volume-title":"Maxflow revisited: An empirical comparison of maxflow algorithms for dense vision problems","author":"Verma T.","year":"2012","unstructured":"T. Verma and D. Batra . Maxflow revisited: An empirical comparison of maxflow algorithms for dense vision problems . 2012 . T. Verma and D. Batra. Maxflow revisited: An empirical comparison of maxflow algorithms for dense vision problems. 2012."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687754"},{"key":"e_1_3_2_1_25_1","volume-title":"VLDB","author":"Wong R.","year":"2007","unstructured":"R. C.-W. Wong , Y. Tao , A. W.-C. Fu , and X. Xiao . On efficient spatial matching . VLDB , 2007 . R. C.-W.Wong, Y. Tao, A. W.-C. Fu, and X. Xiao. On efficient spatial matching. VLDB, 2007."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0758"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"New York New York USA","acronym":"SIGMOD\/PODS'13"},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465321","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2465321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:06Z","timestamp":1750235946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":26,"alternative-id":["10.1145\/2463676.2465321","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2465321","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}