Distributed approximation algorithms for maximum matching in graphs and hypergraphs.
David G. HarrisPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- maximum matching
- bipartite graph
- undirected graph
- np hard
- special case
- vertex cover
- graph theory
- minimum cost
- worst case
- approximation guarantees
- facility location problem
- primal dual
- constant factor
- approximation ratio
- randomized algorithms
- approximation schemes
- set cover
- combinatorial auctions
- weighted graph
- open shop
- disjoint paths
- learning algorithm
- graph structure
- link prediction
- random walk
- lower bound
- optimal solution
- reinforcement learning
- stable set
- social networks