Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs.
David G. HarrisPublished in: FOCS (2019)
Keyphrases
- approximation algorithms
- maximum matching
- bipartite graph
- undirected graph
- np hard
- special case
- graph theory
- vertex cover
- worst case
- facility location problem
- approximation guarantees
- randomized algorithms
- minimum cost
- set cover
- approximation ratio
- open shop
- primal dual
- spanning tree
- polynomial time approximation
- approximation schemes
- directed graph
- disjoint paths
- machine learning
- stable set
- active learning
- learning algorithm