English

A Local Computation Approximation Scheme to Maximum Matching

Data Structures and Algorithms 2013-06-24 v1
Authors: Yishay Mansour , Shai Vardi
View on arXiv ↗ PDF ↗

Abstract

We present a polylogarithmic local computation matching algorithm which guarantees a (1−\eps)(1-\eps)-approximation to the maximum matching in graphs of bounded degree.

Keywords

graph matching approximation algorithm graph algorithms

Cite

@article{arxiv.1306.5003,
  title  = {A Local Computation Approximation Scheme to Maximum Matching},
  author = {Yishay Mansour and Shai Vardi},
  journal= {arXiv preprint arXiv:1306.5003},
  year   = {2013}
}

Comments

Appears in Approx 2013

Related papers

View all related →
Distributed, Parallel, and Cluster Computing · Computer Science
An optimal local approximation algorithm for max-min linear programs
Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela
2012-05-15
Computational Geometry · Computer Science
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs
Sariel Har-Peled, Everett Yang
2022-03-17
Distributed, Parallel, and Cluster Computing · Computer Science
Distributed Maximum Matching in Bounded Degree Graphs
Guy Even, Moti Medina, Dana Ron
2014-11-12
Data Structures and Algorithms · Computer Science
Stochastic Matching via In-n-Out Local Computation Algorithms
Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Ronitt Rubinfeld
2025-06-25
Data Structures and Algorithms · Computer Science
P-SLOCAL-Completeness of Maximum Independent Set Approximation
Yannic Maus
2019-12-24
Distributed, Parallel, and Cluster Computing · Computer Science
Local algorithms in (weakly) coloured graphs
Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela +1
2010-02-02
Data Structures and Algorithms · Computer Science
Local Computation Algorithms for Graphs of Non-Constant Degrees
Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee
2015-02-16
Data Structures and Algorithms · Computer Science
Distributed local approximation algorithms for maximum matching in graphs and hypergraphs
David G. Harris
2023-10-13
Data Structures and Algorithms · Computer Science
Local Computation Algorithms for Maximum Matching: New Lower Bounds
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
2023-11-17
Data Structures and Algorithms · Computer Science
Local Computation Algorithms for Coloring of Uniform Hypergraphs
Andrzej Dorobisz, Jakub Kozik
2021-03-23
Computational Complexity · Computer Science
On the Minimum Degree up to Local Complementation: Bounds and Complexity
Jérôme Javelle, Mehdi Mhalla, Simon Perdrix
2016-10-11
Distributed, Parallel, and Cluster Computing · Computer Science
Approximating max-min linear programs with local algorithms
Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela
2008-09-09
Distributed, Parallel, and Cluster Computing · Computer Science
Local approximation algorithms for a class of 0/1 max-min linear programs
Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela
2008-12-18
Computational Complexity · Computer Science
Maximum Matching and Related Problems in Catalytic Logspace
Srijan Chakraborty, Samir Datta, Aryan Kusre, Partha Mukhopadhyay +1
2026-04-28
Data Structures and Algorithms · Computer Science
Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs
Nate Veldt
2023-05-16
Data Structures and Algorithms · Computer Science
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem
Etienne Bamas, Marina Drygala, Ola Svensson
2022-08-25
Computational Complexity · Computer Science
Settling the complexity of local max-cut (almost) completely
Robert Elsaesser, Tobias Tscheuschner
2011-06-27
Quantum Physics · Physics
Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
Ryan L. Mann, Michael J. Bremner
2019-07-12
Data Structures and Algorithms · Computer Science
Stochastic Matching with Few Queries: $(1-\varepsilon)$ Approximation
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi
2020-02-28
Data Structures and Algorithms · Computer Science
On the Approximation Performance of Degree Heuristics for Matching
Bert Besser, Bastian Werth
2016-12-21
Distributed, Parallel, and Cluster Computing · Computer Science
Tight local approximation results for max-min linear programs
Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela
2012-05-15
Data Structures and Algorithms · Computer Science
Local search breaks 1.75 for Graph Balancing
Klaus Jansen, Lars Rohwedder
2018-11-05
Discrete Mathematics · Computer Science
Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms
David Cattanéo, Simon Perdrix
2016-08-18
Distributed, Parallel, and Cluster Computing · Computer Science
Local Computation: Lower and Upper Bounds
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
2016-04-01
Computational Complexity · Computer Science
FPRAS for computing a lower bound for weighted matching polynomial of graphs
Shmuel Friedland
2007-05-23
R2 v1 2026-06-22T00:37:49.608Z