Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang. A linear programming and rounding approach to max 2-sat. In David S. Johnson, Michael A. Trick, editors, Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 395-414, DIMACS/AMS, 1993.
@inproceedings{CheriyanCTW93,
title = {A linear programming and rounding approach to max 2-sat},
author = {Joseph Cheriyan and William H. Cunningham and Levent Tunçel and Yaoguang Wang},
year = {1993},
researchr = {https://researchr.org/publication/CheriyanCTW93},
cites = {0},
citedby = {0},
pages = {395-414},
booktitle = {Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993},
editor = {David S. Johnson and Michael A. Trick},
volume = {26},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
publisher = {DIMACS/AMS},
}