Max-min greedy matching problem: Hardness for the adversary and fractional variant.

T.-H. Hubert Chan Zhihao Gavin Tang Quan Xue

Published in: Theor. Comput. Sci. (2024)

Keyphrases

max min
hill climbing
min max
search algorithm
matching algorithm
greedy algorithm
computational complexity
neural network
search space
np hard
dynamic programming
graph matching
artificial neural networks
worst case
simulated annealing