Work

A framework for boosting matching approximation: parallel, distributed, and dynamic

Year: 2025

Type: conference-paper

Abstract: This work designs a framework for boosting the approximation guarantee of maximum matching algorithms. As input, the framework receives a parameter ϵ > 0 and an oracle access to a Θ(1)-approximate maximum matching algorithm Ā. Then, by invoking Ā for poly(1/ϵ) many times, the framework outputs a 1 + ϵ approximation of a maximum matching. Our approach yields several improvements in terms of the number of invocations to Ā:

Source: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

DOI: 10.1145/3694906.3743312

Authors: Slobodan Mitrović, Wen-Horng Sheu

Institutions: University of Novi Sad, University of California, Davis

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: National Science Foundation, Simons Institute for the Theory of Computing, University of California Berkeley

Award: CAREER: Fast Scalable Graph Algorithms