@InProceedings{newman:OASIcs.SOSA.2018.13,
  author =	{Newman, Alantha},
  title =	{{Complex Semidefinite Programming and Max-k-Cut}},
  booktitle =	{1st Symposium on Simplicity in Algorithms (SOSA 2018)},
  pages =	{13:1--13:11},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-064-4},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{61},
  editor =	{Seidel, Raimund},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.13},
  URN =		{urn:nbn:de:0030-drops-83098},
  doi =		{10.4230/OASIcs.SOSA.2018.13},
  annote =	{Keywords: Graph Partitioning, Max-k-Cut, Semidefinite Programming}
}