A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph.
Wenxing ZhuChuanyin GuoPublished in: PAAP (2011)
Keyphrases
- learning algorithm
- optimal solution
- closed form
- computational complexity
- tree structure
- vertex set
- detection algorithm
- simulated annealing
- dynamic programming
- matching algorithm
- graph based algorithm
- k means
- hyper graph
- maximum flow
- graph partitioning
- dominating set
- weighted graph
- minimum cut
- graph structure
- random walk
- higher order
- probabilistic model
- np hard
- multi objective
- search space
- search algorithm
- error bounds
- memetic algorithm
- graph construction
- graph search
- artificial ants
- polynomial time complexity
- objective function