A class of bounded approximation algorithms for graph partitioning. - Thomas A. Feo; Mallek Khellaf (Networks, 1990)

One-Half Approximation Algorithms for the k-Partition Problem. - Thomas A. Feo; Olivier Goldschmidt; Mallek Khellaf (Oper. Res., 1992)