Approximating Maximum Matching Requires Almost Quadratic Time
Abstract
References
Index Terms
- Approximating Maximum Matching Requires Almost Quadratic Time
Recommendations
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching
STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of ComputingSublinear time algorithms for approximating maximum matching size have long been studied. Much of the progress over the last two decades on this problem has been on the algorithmic side. For instance, an algorithm of [Behnezhad; FOCS’21] obtains a 1/2-...
Distributed Maximum Matching in Bounded Degree Graphs
ICDCN '15: Proceedings of the 16th International Conference on Distributed Computing and NetworkingWe present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted case computes a matching whose size is at least (1−ϵ) times the optimal in ...
An estimator for matching size in low arboricity graphs with two applications
AbstractIn this paper, we present a new degree-based estimator for the size of maximum matching in bounded arboricity graphs. When the arboricity of the graph is bounded by , the estimator gives a factor approximation of the matching size. For planar ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/de19c9d1-d71b-445e-8b46-5fbe0094e40c/3618260.cover.jpg)
- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- David and Lucile Packard Fellowship
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 82Total Downloads
- Downloads (Last 12 months)82
- Downloads (Last 6 weeks)10
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in