Indexed by：
Abstract：
Given a graph or hypergraph, the graph or hypergraph Max-k-Cut problem is to partition the vertices into k nonempty sets such that the sum of weights of edges across different sets is maximized. We present a deterministic local search algorithm for the problem, which has a performance ratio 1 - 1/k for Max-k-Cut of graph, and has a similar result for Max-k-Cut of hypergraph. © 2011 IEEE.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
Year： 2011
Page： 236-240
Language： English
Cited Count：
SCOPUS Cited Count： 2
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 3
Affiliated Colleges：
