{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:34:23Z","timestamp":1769315663579,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:00:00Z","timestamp":1743033600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:00:00Z","timestamp":1743033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007537","name":"Freie Universit\u00e4t Berlin","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007537","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In the max\u2013min allocation problem a set <jats:italic>P<\/jats:italic> of players are to be allocated disjoint subsets of a set <jats:italic>R<\/jats:italic> of indivisible resources, such that the minimum utility among all players is maximized. We study the restricted variant, also known as the Santa Claus problem, where each resource has an intrinsic positive value, and each player covets a subset of the resources. Bez\u00e1kov\u00e1 and Dani (SIGecom Exch 5(3):11\u201318, 2005) showed that this problem is NP-hard to approximate within a factor less than 2, consequently a great deal of work has focused on approximate solutions. The principal approach for obtaining approximation algorithms has been via the Configuration LP (CLP) of Bansal and Sviridenko (Proceedings of the 38th ACM Symposium on Theory of Computing, 2006). Accordingly, there has been much interest in bounding the integrality gap of this CLP. The existing algorithms and integrality gap estimations are all based one way or another on the combinatorial augmenting tree argument of Haxell (Graphs Comb 11(3):245\u2013248, 1995) for finding perfect matchings in certain hypergraphs. Our main innovation in this paper is to introduce the use of topological methods, to replace the combinatorial argument of Haxell (Graphs Comb 11(3):245\u2013248, 1995) for the restricted max\u2013min allocation problem. This approach yields substantial improvements in the integrality gap of the CLP. In particular we improve the previously best known bound of 3.808 to 3.534. We also study the <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$(1,\\varepsilon )$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>-restricted version, in which resources can take only two values, and improve the integrality gap in most cases. Our approach applies a criterion of Aharoni and Haxell, and Meshulam, for the existence of independent transversals in graphs, which involves the connectedness of the independence complex. This is complemented by a graph process of Meshulam that decreases the connectedness of the independence complex in a controlled fashion and hence, tailored appropriately to the problem, can verify the criterion. In our applications we aim to establish the flexibility of the approach and hence argue for it to be a potential asset in other optimization problems involving hypergraph matchings.<\/jats:p>","DOI":"10.1007\/s00493-025-00141-7","type":"journal-article","created":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T06:11:51Z","timestamp":1743315111000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Integrality Gap in Max\u2013Min Allocation, or, Topology at the North Pole"],"prefix":"10.1007","volume":"45","author":[{"given":"Penny","family":"Haxell","sequence":"first","affiliation":[]},{"given":"Tibor","family":"Szab\u00f3","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,27]]},"reference":[{"key":"141_CR1","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1016\/j.disc.2011.06.010","volume":"311","author":"M Adamaszek","year":"2011","unstructured":"Adamaszek, M., Barmak, J.A.: On a lower bound for the connectivity of the independence complex of a graph. Discret. Math. 311, 2566\u20132569 (2011)","journal-title":"Discret. Math."},{"key":"141_CR2","doi-asserted-by":"publisher","first-page":"4895","DOI":"10.1090\/S0002-9947-06-03833-5","volume":"358","author":"R Aharoni","year":"2006","unstructured":"Aharoni, R., Berger, E.: The intersection of a matroid and a simplicial complex. Trans. Am. Math. Soc. 358, 4895\u20134917 (2006)","journal-title":"Trans. Am. Math. Soc."},{"key":"141_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/jgt.22140","volume":"87","author":"R Aharoni","year":"2018","unstructured":"Aharoni, R., Berger, E., Kotlar, D., Ziv, R.: Degree conditions for matchability in 3-partite hypergraphs. J. Graph Theory 87, 61\u201371 (2018)","journal-title":"J. Graph Theory"},{"key":"141_CR4","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s00373-014-1439-8","volume":"31","author":"R Aharoni","year":"2015","unstructured":"Aharoni, R., Berger, E., Spr\u00fcssel, P.: Two disjoint independent bases in matroid-graph pairs. Graphs Comb. 31, 1107\u20131116 (2015)","journal-title":"Graphs Comb."},{"issue":"3","key":"141_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00493-007-2086-y","volume":"27","author":"R Aharoni","year":"2007","unstructured":"Aharoni, R., Berger, E., Ziv, R.: Independent systems of representatives in weighted graphs. Combinatorica 27(3), 253\u2013267 (2007)","journal-title":"Combinatorica"},{"issue":"2","key":"141_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V","volume":"35","author":"R Aharoni","year":"2000","unstructured":"Aharoni, R., Haxell, P.: Hall\u2019s theorem for hypergraphs. J. Graph Theory 35(2), 83\u201388 (2000)","journal-title":"J. Graph Theory"},{"issue":"2","key":"141_CR7","doi-asserted-by":"publisher","first-page":"2.27","DOI":"10.37236\/2488","volume":"22","author":"R Aharoni","year":"2015","unstructured":"Aharoni, R., Holzman, R., Howard, D., Spr\u00fcssel, P.: Cooperative colorings and independent sets of representatives. Electron. J. Comb. 22(2), 2.27 (2015)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"141_CR8","doi-asserted-by":"publisher","first-page":"37: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. Algorithms 13(3), 37:1-37:28 (2017)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"141_CR9","doi-asserted-by":"publisher","first-page":"24: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. Algorithms 8(3), 24:1-24:9 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"141_CR10","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of individual goods. In: Proceedings of ACM Symposium on the Theory of Computation (STOC), pp. 114\u2013121 (2007)","DOI":"10.1145\/1250790.1250808"},{"key":"141_CR11","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"141_CR12","doi-asserted-by":"crossref","unstructured":"Bateni, M.H., Charikar, M., Guruswami, V.: New approximation algorithms for degree lower bounded arborescences and max-min allocation. Tech Report TR-848-09. Computer Science Department, Princeton University (2009)","DOI":"10.1145\/1536414.1536488"},{"issue":"3","key":"141_CR13","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, Varsha: Allocating indivisible goods. SIGecom Exch. 5(3), 11\u201318 (2005)","journal-title":"SIGecom Exch."},{"key":"141_CR14","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Chuzhoy, J., Khanna, S.: On allocating goods to maximize fairness. In: Proceedings of the 50th IEEE Symposium on Foundations of Computer Science, pp. 107\u2013116 (2009)","DOI":"10.1109\/FOCS.2009.51"},{"key":"141_CR15","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1007\/s00453-018-0407-8","volume":"80","author":"T-H Chan","year":"2018","unstructured":"Chan, T.-H., Tang, Z., Wu, X.: On $$(1,\\varepsilon )$$-restricted max-min fair allocation problem. Algorithmica 80, 2181\u20132200 (2018)","journal-title":"Algorithmica"},{"key":"141_CR16","unstructured":"Cheng, S.-W., Mao, Y.: Restricted max\u2013min fair allocation. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, pp. 37:1\u201337:13 (2018)"},{"key":"141_CR17","unstructured":"Cheng, S.-W., Mao, Y.: Integrality gap of the configuration LP for the restricted max\u2013min fair allocation. CoRR (2018). arXiv:1807.04152"},{"key":"141_CR18","unstructured":"Cheng, S.-W., Mao, Y.: Restricted max\u2013min allocation: approximation and integrality gap. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, pp. 38:1\u201338:13 (2019)"},{"key":"141_CR19","doi-asserted-by":"crossref","unstructured":"Davies, S., Rothvoss, T., Zhang, Y.: A tale of Santa Claus, hypergraphs and matroids. In: Proceedings of the 31st ACM-SIAM Symposium on Discrete Algorithms, pp. 2748\u20132757 (2020)","DOI":"10.1137\/1.9781611975994.167"},{"key":"141_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00453-003-1077-7","volume":"39","author":"L Epstein","year":"2004","unstructured":"Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39, 43\u201357 (2004)","journal-title":"Algorithmica"},{"key":"141_CR21","unstructured":"Feige, U.: On allocations that maximize fairness. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, pp. 287\u2013293 (2008)"},{"key":"141_CR22","unstructured":"Golovin, D.: Max\u2013min fair allocation of indivisible goods. Technical Report. Carnegie Mellon University, CMU-CS-05-144 (2005)"},{"issue":"6","key":"141_CR23","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/2049697.2049702","volume":"58","author":"B Haeupler","year":"2011","unstructured":"Haeupler, B., Saha, B., Srinivasan, A.: New constructive aspects of the Lov\u00e1sz local lemma. J. ACM 58(6), 28:1-28:28 (2011)","journal-title":"J. ACM"},{"issue":"3","key":"141_CR24","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF01793010","volume":"11","author":"P Haxell","year":"1995","unstructured":"Haxell, P.: A condition for matchability in hypergraphs. Graphs Comb. 11(3), 245\u2013248 (1995)","journal-title":"Graphs Comb."},{"key":"141_CR25","series-title":"IMA Volume in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-24298-9_9","volume-title":"Recent Trends in Combinatorics","author":"P Haxell","year":"2016","unstructured":"Haxell, P.: Independent transversals and hypergraph matchings\u2013an elementary approach. In: Beveridge, A., Griggs, J., Hogben, L., Musiker, G., Tetali, P. (eds.) Recent Trends in Combinatorics. IMA Volume in Mathematics and its Applications, pp. 215\u2013233. Springer, Cham (2016)"},{"key":"141_CR26","doi-asserted-by":"crossref","unstructured":"Haxell, P.: Topological connectedness and independent sets in graphs. In: Surveys in Combinatorics 2019. London Mathematical Society Lecture Notes, vol. 456, pp. 89\u2013113. Cambridge University Press, Cambridge (2019)","DOI":"10.1017\/9781108649094.004"},{"key":"141_CR27","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1017\/S0963548318000147","volume":"27","author":"P Haxell","year":"2018","unstructured":"Haxell, P., Narins, L.: A stability theorem for matchings in tripartite 3-graphs. Comb. Probab. Comput. 27, 774\u2013793 (2018)","journal-title":"Comb. Probab. Comput."},{"key":"141_CR28","doi-asserted-by":"crossref","unstructured":"Jansen, K., Rohwedder, L.: On the configuration-LP of the restricted assignment problem. In: Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 2670\u20132678 (2017)","DOI":"10.1137\/1.9781611974782.176"},{"key":"141_CR29","doi-asserted-by":"crossref","unstructured":"Jansen, K., Rohwedder, L.: A quasi-polynomial approximation for the restricted assignment problem. In: Proceedings of the 19th Conference on Integer Programming and Combinatorial Optimization (IPCO) (2017)","DOI":"10.1007\/978-3-319-59250-3_25"},{"key":"141_CR30","unstructured":"Jansen, K., Rohwedder, L.: A note on the integrality gap of the configuration LP for restricted Santa Claus. CoRR (2018). arXiv:1807.03626"},{"key":"141_CR31","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. In: Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pp. 217\u2013224 (1987)","DOI":"10.1109\/SFCS.1987.8"},{"key":"141_CR32","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: Of approximately fair allocation of indivisible goods. In: ACM Conference on Electric Commerce, pp. 125\u2013131 (2005)","DOI":"10.1145\/988772.988792"},{"key":"141_CR33","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s004930170006","volume":"21","author":"R Meshulam","year":"2001","unstructured":"Meshulam, R.: The clique complex and hypergraph matching. Combinatorica 21, 89\u201394 (2001)","journal-title":"Combinatorica"},{"key":"141_CR34","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0097-3165(03)00045-1","volume":"102","author":"R Meshulam","year":"2003","unstructured":"Meshulam, R.: Domination numbers and homology. J. Combin. Theory Ser. A 102, 321\u2013330 (2003)","journal-title":"J. Combin. Theory Ser. A"},{"key":"141_CR35","doi-asserted-by":"crossref","unstructured":"Polacek, L., Svensson, O.: Quasi-polynomial local search for restricted max\u2013min fair allocation. In: 39th International Colloquium on Automata, Languages, and Programming, pp. 726\u2013737 (2012)","DOI":"10.1007\/978-3-642-31594-7_61"},{"key":"141_CR36","doi-asserted-by":"crossref","unstructured":"Svensson, O.: Santa Claus schedules jobs on unrelated machines. SIAM J. Comput. 41(5), 1318\u20131341 (2012). Extended abstract in ACM Symposium on Theory of Computing (STOC) (2011)","DOI":"10.1137\/110851201"},{"key":"141_CR37","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger, G.J.: A polynomial time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett. 20, 149\u2013154 (1997)","journal-title":"Oper. Res. Lett."},{"key":"141_CR38","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS J. Comput. 12, 57\u201375 (2000)","journal-title":"INFORMS J. Comput."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00141-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-025-00141-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00141-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T08:56:44Z","timestamp":1746521804000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-025-00141-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,27]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["141"],"URL":"https:\/\/doi.org\/10.1007\/s00493-025-00141-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,27]]},"assertion":[{"value":"16 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"22"}}