A greedy algorithm for finding a large 2-matching on a random cubic graph
Deepak BalPatrick BennettTom BohmanAlan M. FriezePublished in: CoRR (2012)
Keyphrases
- greedy algorithm
- graph matching
- greedy algorithms
- affinity graph
- dynamic programming
- set cover
- greedy heuristic
- objective function
- random walk
- influence maximization
- worst case
- randomized algorithm
- social networks
- submodular functions
- association graph
- greedy strategy
- connected components
- bipartite graph
- graph cuts
- approximation ratio