%0 Journal Article
%T Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis
%A Koichi Yamazaki
%J Algorithms | An Open Access Journal from MDPI
%D 2018
%R https://doi.org/10.3390/a11110173
%X Abstract Wu et al. (2014) showed that under the small set expansion hypothesis (SSEH) there is no polynomial time approximation algorithm with any constant approximation factor for several graph width parameters, including tree-width, path-width, and cut-width (Wu et al. 2014). In this paper, we extend this line of research by exploring other graph width parameters: We obtain similar approximation hardness results under the SSEH for rank-width and maximum induced matching-width, while at the same time we show the approximation hardness of carving-width, clique-width, NLC-width, and boolean-width. We also give a simpler proof of the approximation hardness of tree-width, path-width, and cut-widththan that of Wu et al. View Full-Tex
%K graph width parameter
%K inapproximability
%K small set expansion hypothesis
%U https://www.mdpi.com/1999-4893/11/11/173