Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions

Yi-Jun Chang, Hsin-Hao Su
2022 Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing  
Many combinatorial optimization problems, including maximum weighted matching and maximum independent set, can be approximated within (1±𝜖) factors in poly(log 𝑛, 1/𝜖) rounds in the LOCAL model via network decompositions [Ghaffari, Kuhn, and Maus, STOC 2018]. These approaches, however, require sending mes-
doi:10.1145/3519270.3538423 fatcat:jv7pwb6wmrhjfirawnl2v4qdra