@inproceedings{f936f58d8f924a09aa4c17084df8e6e8,

title = "Constructing worst case instances for semidefinite programming based approximation algorithms",

abstract = "Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain performance guarantees using local ratio techniques. Are the bounds obtained in this way tight? This problem was considered before by Karloff and by Alon and Sudakov. Here we further extend their results and show, for the first time, that the local analyses of the Goemans and Williamson MAX CUT algorithm, as well as its extension by Zwick, are tight for every possible relative size of the maximum cut. We also obtain similar results for several related problems. Our approach is quite general and could possibly be applied to some additional problems and algorithms.",

keywords = "Algorithms, Performance, Theory, Verification",

author = "Noga Alon and Benny Sudakov and Uri Zwick",

year = "2001",

language = "English (US)",

isbn = "0898714907",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

pages = "92--100",

booktitle = "Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms",

note = "2001 Operating Section Proceedings, American Gas Association ; Conference date: 30-04-2001 Through 01-05-2001",

}