Login / Signup
Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant.
T.-H. Hubert Chan
Zhihao Gavin Tang
Quan Xue
Published in:
IJTCS-FAW (2023)
Keyphrases
</>
max min
hill climbing
min max
greedy algorithm
matching algorithm
search algorithm
computational complexity
image matching
search space
np hard
robust optimization
genetic algorithm
learning algorithm
decision making
evolutionary algorithm
dynamic programming