{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T02:59:33Z","timestamp":1774321173129,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Innovation and Technology Commission (ITC) Hong Kong","award":["ITP\/024\/18LP"],"award-info":[{"award-number":["ITP\/024\/18LP"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412076","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T05:31:03Z","timestamp":1603085463000},"page":"2121-2124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Recursive Balanced k-Subset Sum Partition for Rule-constrained Resource Allocation"],"prefix":"10.1145","author":[{"given":"Zhuo","family":"Li","sequence":"first","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, China"}]},{"given":"Jiannong","family":"Cao","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, China"}]},{"given":"Zhongyu","family":"Yao","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, China"}]},{"given":"Wengen","family":"Li","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, China"}]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, China"}]},{"given":"Jia","family":"Wang","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"R. Bellman. 2003. Dynamic Programming.  R. Bellman. 2003. Dynamic Programming."},{"key":"e_1_3_2_2_2_1","unstructured":"P. E Black. 2005. Greedy Algorithm. Technical Report. Dictionary of Algorithms and Data Structures.  P. E Black. 2005. Greedy Algorithm. Technical Report. Dictionary of Algorithms and Data Structures."},{"key":"e_1_3_2_2_3_1","unstructured":"T. H. Cormen C. Stein R. L. Rivest and C. E. Leiserson. 2001. Introduction to Algorithms.  T. H. Cormen C. Stein R. L. Rivest and C. E. Leiserson. 2001. Introduction to Algorithms."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"R. E. Korf. 1998. A Complete Anytime Algorithm for Number Partitioning.  R. E. Korf. 1998. A Complete Anytime Algorithm for Number Partitioning.","DOI":"10.1016\/S0004-3702(98)00086-1"},{"key":"e_1_3_2_2_5_1","unstructured":"R. E. Korf. 2009. Multi-Way Number Partitioning.  R. E. Korf. 2009. Multi-Way Number Partitioning."}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland","acronym":"CIKM '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412076","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:29Z","timestamp":1750197749000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":5,"alternative-id":["10.1145\/3340531.3412076","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412076","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}