TY - GEN
T1 - Semidefinite programming based approximation algorithms
AU - Zwick, Uri
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
PY - 2001
Y1 - 2001
N2 - The talk would describe the use of semidefinite programming in the development of approximation algorithms for combinatorial optimization problems. The talk would start with a definition of semidefinite programming. No prior knowledge of the subject would be assumed. It would then briefly cover Lovász’s ϑ-function, the MAX CUT approximation algorithm of Goemans and Williamson, the coloring algorithm of Karger, Motwani and Sudan, the MAX 3-SAT algorithm of Karloff and Zwick, and time permitting more modern developments.
AB - The talk would describe the use of semidefinite programming in the development of approximation algorithms for combinatorial optimization problems. The talk would start with a definition of semidefinite programming. No prior knowledge of the subject would be assumed. It would then briefly cover Lovász’s ϑ-function, the MAX CUT approximation algorithm of Goemans and Williamson, the coloring algorithm of Karger, Motwani and Sudan, the MAX 3-SAT algorithm of Karloff and Zwick, and time permitting more modern developments.
UR - http://www.scopus.com/inward/record.url?scp=84944044575&partnerID=8YFLogxK
U2 - 10.1007/3-540-45294-x_5
DO - 10.1007/3-540-45294-x_5
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84944044575
SN - 3540430024
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 57
BT - FST TCS 2001
A2 - Hariharan, Ramesh
A2 - Vinay, V.
A2 - Mukund, Madhavan
PB - Springer Verlag
T2 - 21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001
Y2 - 13 December 2001 through 15 December 2001
ER -