Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs.
Shuchi ChawlaKonstantin MakarychevTselil SchrammGrigory YaroslavtsevPublished in: STOC (2015)
Keyphrases
- linear programming
- graph structure
- optimal solution
- search space
- cost function
- learning algorithm
- preprocessing
- computational complexity
- matching algorithm
- dynamic programming
- worst case
- adjacency graph
- convergence rate
- detection algorithm
- optimization algorithm
- segmentation algorithm
- simulated annealing
- neural network
- np hard
- objective function
- similarity measure
- particle swarm optimization
- evolutionary algorithm
- bayesian networks
- minimum spanning tree
- finding the shortest path