{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T01:05:23Z","timestamp":1775523923034,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"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":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645613","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"178-186","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Fair Surveillance Assignment Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4211-4551","authenticated-orcid":false,"given":"Fangxiao","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7500-8355","authenticated-orcid":false,"given":"Bo","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Fair clustering via equitable group representations. CoRR","author":"Abbasi Mohsen","year":"2020","unstructured":"Mohsen Abbasi, Aditya Bhaskara, and Suresh Venkatasubramanian. 2020. Fair clustering via equitable group representations. CoRR , Vol. abs\/2006.11009 (2020)."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.103965"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.01.007"},{"key":"e_1_3_2_2_4_1","volume-title":"APPROX-RANDOM (LIPIcs","volume":"23","author":"Bhaskar Umang","year":"2021","unstructured":"Umang Bhaskar, A. R. Sricharan, and Rohit Vaish. 2021. On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. In APPROX-RANDOM (LIPIcs, Vol. 207). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 1:1--1:23."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355902"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1359134"},{"key":"e_1_3_2_2_9_1","volume-title":"Fair Graphical Resource Allocation with Matching-Induced Utilities. CoRR","author":"Chen Zheng","year":"2022","unstructured":"Zheng Chen, Bo Li, Minming Li, and Guochuan Zhang. 2022. Fair Graphical Resource Allocation with Matching-Induced Utilities. CoRR , Vol. abs\/2212.01031 (2022)."},{"key":"e_1_3_2_2_10_1","volume-title":"Approximating Fair Clustering with Cascaded Norm Objectives","author":"Eden Chlamt\u00e1","unstructured":"Eden Chlamt\u00e1 c, Yury Makarychev, and Ali Vakilian. 2022. Approximating Fair Clustering with Cascaded Norm Objectives. In SODA. SIAM, 2664--2683."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Edith Elkind Erel Segal-Halevi and Warut Suksompong. 2021. Keep Your Distance: Land Division With Separation. In IJCAI. ijcai.org 168--174.","DOI":"10.24963\/ijcai.2021\/24"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-9992-y"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.11.010"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2015.01.001"},{"key":"e_1_3_2_2_15_1","unstructured":"George Gamow and Marvin Stern. 1958. Puzzle-Math. Viking press."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103547"},{"key":"e_1_3_2_2_17_1","volume-title":"J\u00e9 r\u00f4 me Monnot, and Lydia Tlilane","author":"Laurent Gourv\u00e8","year":"2014","unstructured":"Laurent Gourv\u00e8 s, J\u00e9 r\u00f4 me Monnot, and Lydia Tlilane. 2014. Near Fairness in Matroids. In ECAI (Frontiers in Artificial Intelligence and Applications, Vol. 263). IOS Press, 393--398."},{"key":"e_1_3_2_2_18_1","volume-title":"2023 a","author":"Hosseini Hadi","year":"2023","unstructured":"Hadi Hosseini, Andrew McGregor, Rik Sengupta, Rohit Vaish, and Vignesh Viswanathan. 2023 a. Tight Approximations for Graphical House Allocation. CoRR , Vol. abs\/2307.12482 (2023)."},{"key":"e_1_3_2_2_19_1","volume-title":"2023 b. Fair Distribution of Delivery Orders. CoRR","author":"Hosseini Hadi","year":"2023","unstructured":"Hadi Hosseini, Shivika Narang, and Tomasz Was. 2023 b. Fair Distribution of Delivery Orders. CoRR , Vol. abs\/2305.00040 (2023)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Xin Huang and Pinyan Lu. 2021. An Algorithmic Framework for Approximating Maximin Share Allocation of Chores. In EC. ACM 630--631.","DOI":"10.1145\/3465456.3467555"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.03.004"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9740-5"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.07.020"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.06.041"},{"key":"e_1_3_2_2_25_1","volume-title":"NeurIPS","author":"Li Bo","year":"2023","unstructured":"Bo Li, Fangxiao Wang, and Yu Zhou. 2023. Fair Allocation of Indivisible Chores: Beyond Additive Costs. In NeurIPS 2023. (to appear)."},{"key":"e_1_3_2_2_26_1","volume-title":"La","author":"Lin Michael","year":"2020","unstructured":"Michael Lin and Richard J. La. 2020. Miniature Robot Path Planning for Bridge Inspection: Min-Max Cycle Cover-Based Approach. In CASE. IEEE, 365--371."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Richard J. Lipton Evangelos Markakis Elchanan Mossel and Amin Saberi. 2004. On approximately fair allocations of indivisible goods. In EC. ACM 125--131.","DOI":"10.1145\/988772.988792"},{"key":"e_1_3_2_2_28_1","volume-title":"Approximation Algorithms for Socially Fair Clustering. CoRR","author":"Makarychev Yury","year":"2021","unstructured":"Yury Makarychev and Ali Vakilian. 2021. Approximation Algorithms for Socially Fair Clustering. CoRR , Vol. abs\/2103.02512 (2021)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.12.059"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M124397X"},{"key":"e_1_3_2_2_31_1","volume-title":"Sur la division pragmatique. Econometrica","author":"Steinhaus Hugo","year":"1949","unstructured":"Hugo Steinhaus. 1949. Sur la division pragmatique. Econometrica , Vol. 17 (Supplement) (1949), 315--319."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Vera Traub and Thorben Tr\u00f6 bst. 2020. A Fast (2 2\/7)-Approximation Algorithm for Capacitated Cycle Covering. In IPCO. Springer 391--404.","DOI":"10.1007\/978-3-030-45771-6_30"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(74)90075-1"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.06.003"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2010.02.004"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0611-6"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Shengwei Zhou and Xiaowei Wu. 2022. Approximately EFX Allocations for Indivisible Chores. In IJCAI. ijcai.org 783--789.","DOI":"10.24963\/ijcai.2022\/110"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645613","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:33:57Z","timestamp":1755822837000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":37,"alternative-id":["10.1145\/3589334.3645613","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645613","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}