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

50 Citations (Scopus)
409 Downloads (Pure)
Original languageEnglish
Pages (from-to)267-294
Number of pages27
JournalJournal of Combinatorial Optimization
Volume8
Issue number3
Publication statusPublished - 2004
  • A new optimization paradigm

    Sturm, J. F. (Principal Investigator), Elfadul, G. E. E. (Researcher), Pasechnik, D. V. (Researcher), de Klerk, E. (Principal Investigator), Sotirov, R. (Researcher) & Bai, Y. (Researcher)

    1/10/011/01/07

    Project: Research project

Cite this