Author:
Bansal Nikhil,Umboh Seeun William
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference7 articles.
1. Inapproximability of hypergraph vertex cover and applications to scheduling problems;Bansal,2010
2. Approximation hardness of dominating set problems in bounded degree graphs;Chlebík;Inf. Comput.,2008
3. A new multilayered PCP and the hardness of hypergraph vertex cover;Dinur;SIAM J. Comput.,2005
4. Analytical approach to parallel repetition;Dinur,2014
5. On the Approximability of NP-complete Optimization Problems;Kann,1992
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Distributed domination on sparse graph classes;European Journal of Combinatorics;2023-08
2. Near-optimal distributed dominating set in bounded arboricity graphs;Distributed Computing;2023-05-15
3. Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20
4. Local Planar Domination Revisited;Structural Information and Communication Complexity;2022
5. Constant Round Distributed Domination on Graph Classes with Bounded Expansion;Structural Information and Communication Complexity;2021