1, the KK heuristic performs poorly as n increases. This is despite the fact that these problems have perfect partitions that can often be found with little search. 1 1e+10 1e+20-40-20 0 20 40 60 80 100 "n=6" "n=12" "n=18" "n=24" Figure 9. Average size of KK partition, hKKi against. Performance guarantees for optimization procedures are often given as a ratio of the optimal value. Since the opt...