{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T21:05:26Z","timestamp":1769288726292,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T00:00:00Z","timestamp":1762819200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T00:00:00Z","timestamp":1762819200000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00224-025-10241-y","type":"journal-article","created":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T09:15:57Z","timestamp":1762852557000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Geometric Programming Approach to Solve the Restricted Assignment Case of the Santa Claus Problem"],"prefix":"10.1007","volume":"69","author":[{"given":"S. Anil","family":"Kumar","sequence":"first","affiliation":[]},{"given":"N. S.","family":"Narayanaswamy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,11]]},"reference":[{"key":"10241_CR1","doi-asserted-by":"publisher","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus Problem. In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, pp. 31\u201340. Association for Computing Machinery, Inc, New York, NY, USA (2006). https:\/\/doi.org\/10.1145\/1132516.1132522","DOI":"10.1145\/1132516.1132522"},{"key":"10241_CR2","doi-asserted-by":"publisher","unstructured":"Davies, S., Rothvoss, T., Zhang, Y.: A Tale of Santa Claus, Hypergraphs and Matroids. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2748\u20132757 (2020). SIAM. https:\/\/doi.org\/10.1137\/1.9781611975994.167","DOI":"10.1137\/1.9781611975994.167"},{"issue":"3","key":"10241_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2229163.2229168","volume":"8","author":"A Asadpour","year":"2012","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa Claus meets hypergraph matchings. ACM Trans. Alg. 8(3), 1\u20139 (2012). https:\/\/doi.org\/10.1145\/2229163.2229168","journal-title":"ACM Trans. Alg."},{"issue":"3","key":"10241_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF01793010","volume":"11","author":"PE Haxell","year":"1995","unstructured":"Haxell, P.E.: A condition for matchability in hypergraphs. Graph. Comb. 11(3), 245\u2013248 (1995). https:\/\/doi.org\/10.1007\/BF01793010","journal-title":"Graph. Comb."},{"issue":"3","key":"10241_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3070694","volume":"13","author":"C Annamalai","year":"2017","unstructured":"Annamalai, C., Kalaitzis, C., Svensson, O.: Combinatorial algorithm for restricted max-min fair allocation. ACM Trans. Alg. 13(3), 1\u201328 (2017). https:\/\/doi.org\/10.1145\/3070694","journal-title":"ACM Trans. Alg."},{"issue":"7","key":"10241_CR6","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1007\/s00453-022-00942-y","volume":"84","author":"S-W Cheng","year":"2022","unstructured":"Cheng, S.-W., Mao, Y.: Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm. Algorithmica 84(7), 1835\u20131874 (2022). https:\/\/doi.org\/10.1007\/s00453-022-00942-y","journal-title":"Algorithmica"},{"key":"10241_CR7","doi-asserted-by":"publisher","unstructured":"Haxell, P., Szab\u00f3, T.: Improved integrality gap in max-min allocation, or topology at the north pole. Combinatorica. 45(2) (2025). https:\/\/doi.org\/10.1007\/s00493-025-00141-7","DOI":"10.1007\/s00493-025-00141-7"},{"issue":"3","key":"10241_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1120680.1120683","volume":"5","author":"I Bez\u00e1kov\u00e1","year":"2005","unstructured":"Bez\u00e1kov\u00e1, I., Dani, V.: Allocating indivisible goods. ACM SIGecom Exch. 5(3), 11\u201318 (2005). https:\/\/doi.org\/10.1145\/1120680.1120683","journal-title":"ACM SIGecom Exch."},{"issue":"1","key":"10241_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11081-007-9001-7","volume":"8","author":"S Boyd","year":"2007","unstructured":"Boyd, S., Kim, S.-J., Vandenberghe, L., Hassibi, A.: A tutorial on geometric programming. Optim. Eng. 8(1), 67\u2013127 (2007). https:\/\/doi.org\/10.1007\/s11081-007-9001-7","journal-title":"Optim. Eng."},{"key":"10241_CR10","doi-asserted-by":"publisher","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge, UK (2004). https:\/\/doi.org\/10.1017\/CBO9780511804441","DOI":"10.1017\/CBO9780511804441"},{"key":"10241_CR11","doi-asserted-by":"publisher","unstructured":"Chiang, M.: Geometric Programming for Communication Systems. Foundations and Trends\u00ae in Communications and Information Theory. 2(1-2), 1\u2013154 (2005). https:\/\/doi.org\/10.1561\/0100000005","DOI":"10.1561\/0100000005"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10241-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-025-10241-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10241-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T08:52:49Z","timestamp":1769244769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-025-10241-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,11]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["10241"],"URL":"https:\/\/doi.org\/10.1007\/s00224-025-10241-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,11]]},"assertion":[{"value":"25 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"38"}}