Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
CoRR(2024)
摘要
We investigate a relaxation of the notion of fractional treewidth-fragility,
namely fractional tree-independence-number-fragility. In particular, we obtain
polynomial-time approximation schemes for meta-problems such as finding a
maximum-weight sparse induced subgraph satisfying a given 𝖢𝖬𝖲𝖮_2
formula on fractionally tree-independence-number-fragile graph classes. Our
approach unifies and extends several known polynomial-time approximation
schemes on seemingly unrelated graph classes, such as classes of intersection
graphs of fat objects in a fixed dimension or proper minor-closed classes. We
also study the related notion of layered tree-independence number, a relaxation
of layered treewidth, and its applications to exact subexponential-time
algorithms.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要