On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function

E. de Klerk, D.V. Pasechnik, J.P. Warners

Research output: Contribution to journalArticleScientificpeer-review

38 Citations (Scopus)
323 Downloads (Pure)
Original languageEnglish
Pages (from-to)267-294
Number of pages27
JournalJournal of Combinatorial Optimization
Volume8
Issue number3
Publication statusPublished - 2004

Cite this