Alexis C. Kaporis, Lefteris M. Kirousis, Elias C. Stavropoulos. Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold. In Yossi Azar, Thomas Erlebach, editors, Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings. Volume 4168 of Lecture Notes in Computer Science, pages 432-443, Springer, 2006. [doi]
@inproceedings{KaporisKS06,
title = {Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold},
author = {Alexis C. Kaporis and Lefteris M. Kirousis and Elias C. Stavropoulos},
year = {2006},
doi = {10.1007/11841036_40},
url = {http://dx.doi.org/10.1007/11841036_40},
tags = {C++},
researchr = {https://researchr.org/publication/KaporisKS06},
cites = {0},
citedby = {0},
pages = {432-443},
booktitle = {Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings},
editor = {Yossi Azar and Thomas Erlebach},
volume = {4168},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-38875-3},
}