A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs.
Jason LiDebmalya PanigrahiThatchaphol SaranurakPublished in: FOCS (2021)
Keyphrases
- dynamic programming
- optimal solution
- computational cost
- preprocessing
- search space
- segmentation algorithm
- cost function
- np hard
- convergence rate
- closed form
- detection algorithm
- optimization algorithm
- worst case
- random graphs
- k means
- neural network
- globally optimal
- clustering algorithm
- learning algorithm
- genetic algorithm
- locally optimal
- graph clustering
- graph construction
- graph mining
- convex hull
- matching algorithm
- simulated annealing
- probabilistic model
- significant improvement
- pairwise
- computational complexity