We compute the exact fractional chromatic number for several classes of monotone self-dual Boolean functions. We characterize monotone self-dual Boolean functions in terms of the optimal value of a LP relaxation of a suitable strengthening of the standard IP formulation for the chromatic number. We also show that determining the self-duality of monotone Boolean function is equivalent to determining feasibility of a certain point in a polytope defined implicitly. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Gaur, D. R., & Makino, K. (2007). On the fractional chromatic number of monotone self-dual boolean functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4613 LNCS, pp. 148–159). Springer Verlag. https://doi.org/10.1007/978-3-540-73814-5_14
Mendeley helps you to discover research relevant for your work.