A combinatorial design approach to MAXCU
β
Thomas Hofmeister; Hanno Lefmann
π
Article
π
1996
π
John Wiley and Sons
π
English
β 710 KB
The k-MAXCUT problem for undirected graphs C = (V, E ) consists of finding a partition V = V , U . . . U V, such that the number of edges with endpoints in two different sets V, is maximized. We offer a new approach to this problem by showing that the combinatorial notion of block designs can be use