On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function

Published in: Journal of Combinatorial Optimization

Volume 8, Issue 3, pp. 267-294

DOI: 10.1023/b:joco.0000038911.67280.3f