skip to main content
10.1145/3564246.3585174acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Better Trees for Santa Claus

Published: 02 June 2023 Publication History

Abstract

We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC’09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem we are given a directed graph with sources and sinks and our goal is to find vertex disjoint arborescences rooted in the sources such that at each non-sink vertex of an arborescence the out-degree is at least k, where k is to be maximized. This problem is of particular interest, since it appears to capture much of the difficulty of the Santa Claus problem: (1) like in the Santa Claus problem the configuration LP has a large integrality gap in this case and (2) previous progress by Bateni et al. was quickly generalized to the Santa Claus problem (Chakrabarty et al. [FOCS’09]). These results remain the state-of-the-art both for the Santa Claus problem and for max-min degree arborescence and they yield a polylogarithmic approximation in quasi-polynomial time. We present an exponential improvement to this, a poly(loglogn)-approximation in quasi-polynomial time for the max-min degree arborescence problem. To the best of our knowledge, this is the first example of breaking the logarithmic barrier for a special case of the Santa Claus problem, where the configuration LP cannot be utilized. The main technical novelty of our result are locally good solutions: informally, we show that it suffices to find a poly(logn)-approximation that locally has stronger guarantees. We use a lift-and-project type of LP and randomized rounding, which were also used by Bateni et al., but unlike previous work we integrate careful pruning steps in the rounding. In the proof we extensively apply Lovász Local Lemma and a local search technique, both of which were previously used only in the context of the configuration LP.

References

[1]
Chidambaram Annamalai. 2019. Lazy local search meets machine scheduling. SIAM J. Comput., 48, 5 (2019), 1503–1543.
[2]
Chidambaram Annamalai, Christos Kalaitzis, and Ola Svensson. 2017. Combinatorial algorithm for restricted max-min fair allocation. ACM Transactions on Algorithms, 13, 3 (2017), 1–28.
[3]
Arash Asadpour, Uriel Feige, and Amin Saberi. 2012. Santa claus meets hypergraph matchings. ACM Transactions on Algorithms, 8, 3 (2012), 24:1–24:9.
[4]
Etienne Bamas, Paritosh Garg, and Lars Rohwedder. 2021. The Submodular Santa Claus Problem in the Restricted Assignment Case. In Proceedings of ICALP.
[5]
Nikhil Bansal. 2017. Scheduling: Open problems old and new. Presentation at MAPSP
[6]
Nikhil Bansal and Maxim Sviridenko. 2006. The santa claus problem. In Proceedings of STOC. 31–40.
[7]
MohammadHossein Bateni, Moses Charikar, and Venkatesan Guruswami. 2009. Maxmin allocation via degree lower-bounded arborescences. In Proceedings of STOC. 543–552.
[8]
Ivona Bezáková and Varsha Dani. 2005. Allocating indivisible goods. ACM SIGecom Exchanges, 5, 3 (2005), 11–18.
[9]
Deeparnab Chakrabarty, Julia Chuzhoy, and Sanjeev Khanna. 2009. On allocating goods to maximize fairness. In Proceedings of FOCS. 107–116.
[10]
Deeparnab Chakrabarty, Sanjeev Khanna, and Shi Li. 2014. On (1,∊ )-Restricted Assignment Makespan Minimization. In Proceedings of SODA. 1087–1101.
[11]
Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, and Ming Li. 1999. Approximation algorithms for directed Steiner problems. Journal of Algorithms, 33, 1 (1999), 73–91.
[12]
Siu-Wing Cheng and Yuchen Mao. 2018. Restricted Max-Min Fair Allocation. In Proceedings of ICALP. 107, 37:1–37:13.
[13]
Siu-Wing Cheng and Yuchen Mao. 2019. Restricted Max-Min Allocation: Approximation and Integrality Gap. In Proceedings of ICALP. 38:1–38:13.
[14]
Herman Chernoff. 1952. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics, 493–507.
[15]
Sami Davies, Thomas Rothvoss, and Yihao Zhang. 2020. A tale of Santa Claus, hypergraphs and matroids. In Proceedings of SODA. 2748–2757.
[16]
Tomás Ebenlendr, Marek Krcál, and Jirí Sgall. 2014. Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines. Algorithmica, 68, 1 (2014), 62–80.
[17]
Uriel Feige. 2008. On allocations that maximize fairness. In Proceedings of SODA. 287–293.
[18]
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, and Nan Wang. 2007. Integrality ratio for group Steiner trees and directed Steiner trees. SIAM J. Comput., 36, 5 (2007), 1494–1511.
[19]
Eran Halperin and Robert Krauthgamer. 2003. Polylogarithmic inapproximability. In Proceedings of STOC. 585–594.
[20]
Penny Haxell and Tibor Szabó. 2023. Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole. In Proceedings of SODA. to appear
[21]
Penny E Haxell. 1995. A condition for matchability in hypergraphs. Graphs and Combinatorics, 11, 3 (1995), 245–248.
[22]
Klaus Jansen, Kati Land, and Marten Maack. 2018. Estimating the makespan of the two-valued restricted assignment problem. Algorithmica, 80, 4 (2018), 1357–1382.
[23]
Klaus Jansen and Lars Rohwedder. 2019. Local Search Breaks 1.75 for Graph Balancing. In Proceedings of ICALP. 74:1–74:14.
[24]
Klaus Jansen and Lars Rohwedder. 2020. A quasi-polynomial approximation for the restricted assignment problem. SIAM J. Comput., 49, 6 (2020), 1083–1108.
[25]
Jan Karel Lenstra, David B Shmoys, and Éva Tardos. 1990. Approximation algorithms for scheduling unrelated parallel machines. Mathematical programming, 46, 1 (1990), 259–271.
[26]
Robin A Moser and Gábor Tardos. 2010. A constructive proof of the general Lovász local lemma. Journal of the ACM (JACM), 57, 2 (2010), 1–15.
[27]
Lukáš Poláček and Ola Svensson. 2015. Quasi-polynomial local search for restricted max-min fair allocation. ACM Transactions on Algorithms, 12, 2 (2015), 1–13.
[28]
Petra Schuurman and Gerhard J Woeginger. 1999. Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling, 2, 5 (1999), 203–213.
[29]
Ola Svensson. 2012. Santa Claus Schedules Jobs on Unrelated Machines. SIAM J. Comput., 41, 5 (2012), 1318.
[30]
José Verschae and Andreas Wiese. 2014. On the configuration-LP for scheduling on unrelated machines. Journal of Scheduling, 17, 4 (2014), 371–383.
[31]
David P Williamson and David B Shmoys. 2011. The design of approximation algorithms. Cambridge university press.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing
June 2023
1926 pages
ISBN:9781450399135
DOI:10.1145/3564246
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 June 2023

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Lovasz Local Lemma
  2. allocation
  3. fairness
  4. max-min

Qualifiers

  • Research-article

Funding Sources

  • NWO

Conference

STOC '23
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 185
    Total Downloads
  • Downloads (Last 12 months)71
  • Downloads (Last 6 weeks)6
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media