31 citations · 61 across the 13 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DC2022★ 1 cited
-Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings
Shang-En Huang, Hsin-Hao Su
The maximum weighted matching (MWM) problem is one of the most well-studied combinatorial optimization problems in distributed graph algorithms. Despite a long development on the p…
cs.DS2022
Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
Yi-Jun Chang, Hsin-Hao Su
Many combinatorial optimization problems can be approximated within factors in rounds in the LOCAL model via network decompositions [Ghaffari…