A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs.

Martin Dietzfelbinger Hendrik Peilke Michael Rink

Published in: SEA (2012)

Keyphrases

greedy heuristic
random graphs
greedy algorithm
np hard
graph theoretic
knapsack problem
learning curves
phase transition
worst case analysis
minimum weight
optimal solution
small world
undirected graph
ranking algorithm
social network analysis
lower bound
bayesian networks