Approximating Maximum Matching Requires Almost Quadratic Time.

Soheil Behnezhad Mohammad Roghani Aviad Rubinstein

Published in: CoRR (2024)

Keyphrases

maximum matching
bipartite graph
stable set
real time
data sets
neural network
data mining
objective function
np hard