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

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

Cite this

@article{7a6fbcee93d04f7d86bebb4a4e78778e,
title = "On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function",
author = "{de Klerk}, E. and D.V. Pasechnik and J.P. Warners",
note = "Pagination: 27",
year = "2004",
language = "English",
volume = "8",
pages = "267--294",
journal = "Journal of Combinatorial Optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",
number = "3",

}

On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function. / de Klerk, E.; Pasechnik, D.V.; Warners, J.P.

In: Journal of Combinatorial Optimization, Vol. 8, No. 3, 2004, p. 267-294.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

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

AU - de Klerk, E.

AU - Pasechnik, D.V.

AU - Warners, J.P.

N1 - Pagination: 27

PY - 2004

Y1 - 2004

M3 - Article

VL - 8

SP - 267

EP - 294

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 3

ER -