Parameterized Inapproximability of Independent Set in H-Free Graphs-Reference-Cited by-同舟云学术

Parameterized Inapproximability of Independent Set in H-Free Graphs

Published:2022-10-20 Issue:4 Volume:85 Page:902-928
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Dvořák Pavel^ORCID,Feldmann Andreas Emil,Rai Ashutosh,Rzążewski Paweł

Funder

Czech Science Foundation GAČR

Center for Foundations of Modern Computer Science

Polish National Science Centre

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00453-022-01052-5.pdf

Reference45 articles.

1. Alekseev, V.: Polynomial algorithm for finding the largest independent sets in graphs without forks. Discret. Appl. Math. 135(1), 3–16 (2004). (Russian Translations II)

2. Alekseev, V.E.: The effect of local constraints on the complexity of determination of the graph independence number. Combinatorial-algebraic methods in applied mathematics, pp. 3–13 (1982)

3. Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. Theory Comput. 7(1), 27–43 (2011)

4. Bansal, N., Gupta, A., Guruganesh, G.: On the Lovász theta function for independent sets in sparse graphs. SIAM J. Comput. 47(3), 1039–1055 (2018)

5. Bonnet, É.: private communication

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Near Optimal Alphabet-Soundness Tradeoff PCPs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10