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 journal › Article › Scientific › peer-review

51 Citations (Scopus)

454 Downloads (Pure)

Original language	English
Pages (from-to)	267-294
Number of pages	27
Journal	Journal of Combinatorial Optimization
Volume	8
Issue number	3
Publication status	Published - 2004

Access to Document

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/01 → 1/01/07
Project: Research project

@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",

}