Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm.

Jun-Ting Hsieh Pravesh K. Kothari

Published in: ICALP (2023)

Keyphrases

max cut
learning algorithm
k means
computational complexity
objective function
search space
simulated annealing
graph structure
dynamic programming
minimum spanning tree
data clustering
weighted graph
shortest path
greedy heuristic
graph model
clustering method
upper bound
reinforcement learning