{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:19:55Z","timestamp":1743023995804,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819778003"},{"type":"electronic","value":"9789819778010"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7801-0_14","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"159-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Plane Segmentation for\u00a0Proportional Division of\u00a0Resources"],"prefix":"10.1007","author":[{"given":"Jiangjun","family":"Shao","sequence":"first","affiliation":[]},{"given":"Hao","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/PL00009187","volume":"20","author":"F Aurenhammer","year":"1998","unstructured":"Aurenhammer, F., Hoffmann, F., Aronov, B.: Minkowski-type theorems and least-squares clustering. Algorithmica 20, 61\u201376 (1998). https:\/\/doi.org\/10.1007\/PL00009187","journal-title":"Algorithmica"},{"issue":"5","key":"14_CR2","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/s0304-4068(03)00077-6","volume":"40","author":"M Berliant","year":"2004","unstructured":"Berliant, M., Dunz, K.: A foundation of location theory: existence of equilibrium, the welfare theorems, and core. J. Math. Econ. 40(5), 593\u2013618 (2004). https:\/\/doi.org\/10.1016\/s0304-4068(03)00077-6","journal-title":"J. Math. Econ."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10479-008-0339-9","volume":"167","author":"O Berman","year":"2009","unstructured":"Berman, O., Drezner, Z., Tamir, A., Wesolowsky, G.O.: Optimal location with equitable loads. Ann. Oper. Res. 167, 307\u2013325 (2009). https:\/\/doi.org\/10.1007\/s10479-008-0339-9","journal-title":"Ann. Oper. Res."},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Bouveret, S., Cechl\u00e1rov\u00e1, K., Elkind, E., Igarashi, A., Peters, D.: Fair division of a graph. arXiv preprint arXiv:1705.10239 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/20","DOI":"10.24963\/ijcai.2017\/20"},{"key":"14_CR5","unstructured":"Boyd, S., Xiao, L., Mutapcic, A.: Subgradient methods. lecture notes of EE392o, Stanford University, Autumn Quarter 2004(01) (2003)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1007\/s11067-015-9303-9","volume":"16","author":"JG Carlsson","year":"2016","unstructured":"Carlsson, J.G., Carlsson, E., Devulapalli, R.: Shadow prices in territory division. Netw. Spat. Econ. 16, 893\u2013931 (2016). https:\/\/doi.org\/10.1007\/s11067-015-9303-9","journal-title":"Netw. Spat. Econ."},{"key":"14_CR7","unstructured":"Devulapalli, R.: Geometric partitioning algorithms for fair division of geographic resources. Ph.D. thesis, University of Minnesota (2014)"},{"issue":"16","key":"14_CR8","doi-asserted-by":"publisher","first-page":"3616","DOI":"10.3390\/math11163616","volume":"11","author":"H Guo","year":"2023","unstructured":"Guo, H., Li, W., Deng, B.: A survey on fair allocation of chores. Mathematics 11(16), 3616 (2023). https:\/\/doi.org\/10.3390\/math11163616","journal-title":"Mathematics"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Li, W., Liu, X., Zhang, X., Zhang, X.: Multi-resource fair allocation with bounded number of tasks in cloud computing systems. In: Theoretical Computer Science: 35th National Conference, NCTCS 2017, Wuhan, China, October 14-15, 2017, Proceedings, vol.\u00a0768, pp. 3\u201317. Springer (2017). https:\/\/doi.org\/10.1007\/978-981-10-6893-5_1","DOI":"10.1007\/978-981-10-6893-5_1"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.future.2024.04.055","volume":"159","author":"X Li","year":"2024","unstructured":"Li, X., Hu, G., Li, W., Zhang, X.: Fair multiresource allocation with access constraint in cloud-edge systems. Futur. Gener. Comput. Syst. 159, 395\u2013410 (2024). https:\/\/doi.org\/10.1016\/j.future.2024.04.055","journal-title":"Futur. Gener. Comput. Syst."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1007\/s00607-017-0561-x","volume":"99","author":"X Liu","year":"2017","unstructured":"Liu, X., Zhang, X., Li, W., Zhang, X.: Swarm optimization algorithms applied to multi-resource fair allocation in heterogeneous cloud computing systems. Computing 99, 1231\u20131255 (2017). https:\/\/doi.org\/10.1007\/s00607-017-0561-x","journal-title":"Computing"},{"key":"14_CR12","doi-asserted-by":"publisher","DOI":"10.1049\/sqj.1970.0088","author":"DG Luenberger","year":"1997","unstructured":"Luenberger, D.G.: Optimization by vector space methods. John Wiley & Sons (1997). https:\/\/doi.org\/10.1049\/sqj.1970.0088","journal-title":"John Wiley & Sons"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Pavone, M., Arsie, A., Frazzoli, E., Bullo, F.: Equitable partitioning policies for robotic networks. 2009 IEEE International Conference on Robotics and Automation pp. 2356\u20132361 (2009). https:\/\/doi.org\/10.1109\/ROBOT.2009.5152809","DOI":"10.1109\/ROBOT.2009.5152809"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Quarteroni, A., Sacco, R., Saleri, F.: Numerical mathematics, vol.\u00a037. Springer Science & Business Media (2006). https:\/\/doi.org\/10.1007\/978-1-4612-4442-4","DOI":"10.1007\/978-1-4612-4442-4"},{"key":"14_CR15","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16(1) (1948). https:\/\/doi.org\/http:\/\/dx.doi.org\/"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.dam.2019.01.036","volume":"260","author":"W Suksompong","year":"2019","unstructured":"Suksompong, W.: Fairly allocating contiguous blocks of indivisible items. Discret. Appl. Math. 260, 227\u2013236 (2019). https:\/\/doi.org\/10.1016\/j.dam.2019.01.036","journal-title":"Discret. Appl. Math."},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Thomson, W.: Fair allocation rules. In: Handbook of social choice and welfare, vol.\u00a02, pp. 393\u2013506. Handbook of Social Choice and Welfare (2011). https:\/\/doi.org\/10.1016\/S0169-7218(10)00021-3","DOI":"10.1016\/S0169-7218(10)00021-3"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Wu, X., Zhang, C., Zhou, S.: One quarter each (on average) ensures proportionality. In: International Conference on Web and Internet Economics, vol. 14413, pp. 582\u2013599. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-48974-7_33","DOI":"10.1007\/978-3-031-48974-7_33"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7801-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:08:40Z","timestamp":1726769320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7801-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819778003","9789819778010"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7801-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}