A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs.
Jason LiDebmalya PanigrahiThatchaphol SaranurakPublished in: FOCS (2022)
Keyphrases
- dynamic programming
- detection algorithm
- worst case
- k means
- learning algorithm
- preprocessing
- optimal solution
- exhaustive search
- graph structure
- closed form
- matching algorithm
- expectation maximization
- polynomial time complexity
- approximation guarantees
- optimization algorithm
- np complete
- computational cost
- np hard
- search space
- similarity measure
- particle swarm optimization
- hyper graph
- reinforcement learning
- minimum spanning tree
- globally optimal
- objective function
- search algorithm
- graph theory
- graph matching
- convergence rate
- convex hull
- computational complexity
- cost function