Improved constant-time approximation algorithms for maximum matchings and other optimization problems
From MaRDI portal
Recommendations
- An improved constant-time approximation algorithm for maximum~matchings
- On constant time approximation of parameters of bounded degree graphs
- Sublinear graph approximation algorithms
- Improved Distributed Approximate Matching
- Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs
Cited in
(19)- Sublinear-time algorithms for counting star subgraphs via edge sampling
- Best of two local models: centralized local and distributed local algorithms
- Approximation algorithms for Max Morse matching
- Improved approximation algorithms for the Min-Max selecting items problem
- Borel oracles. An analytical approach to constant-time algorithms
- Sublinear graph approximation algorithms
- On constant time approximation of parameters of bounded degree graphs
- On the probe complexity of local computation algorithms
- An improved constant-time approximation algorithm for maximum~matchings
- Local computation algorithms for graphs of non-constant degrees
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- Average Sensitivity of Graph Algorithms
- On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions
- Sublinear algorithms for (1.5+)-approximate matching
- Sublinear algorithms and lower bounds for metric TSP cost estimation
- Spanning adjacency oracles in sublinear time
- Dynamic matching with better-than-2 approximation in polylogarithmic update time
- Tolerant testers for subgraph-freeness
- Local computation algorithms for knapsack: impossibility results, and how to avoid them
This page was built for publication: Improved constant-time approximation algorithms for maximum matchings and other optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143303)
