bibtex: @TECHREPORT{Huang-TR292, AUTHOR = "M.A. Huang and Karl J. Lieberherr", TITLE = "Implications of forbidden structures for extremal algorithmic problems", INSTITUTION = "Princeton University, Dept. of EECS", YEAR = 1981, NUMBER = "292", Note = "http://www.ccs.neu.edu/research/demeter/biblio/ming-deh-tr292.html" } This is the precursor to the following journal article: @ARTICLE{lieber-huang:tcs-85, AUTHOR = "M.A. Huang and Karl J. Lieberherr ", TITLE = "Implications of forbidden structures for extremal algorithmic problems", JOURNAL = tcs, VOLUME = 40, YEAR = 1985, PAGES = "195-210" }

Discussion: These two papers try to extend the reach of the P-optimal approximation algorithms. There might be some useful algorithmic ideas to improve SAT solvers.