Author:
Bazgan Cristina,Chopin Morgan,Nichterlein André,Sikora Florian
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. Approximation algorithms and hardness for domination with propagation;Aazami;SIAM J. Discrete Math.,2009
2. Some APX-completeness results for cubic graphs;Alimonti;Theor. Comput. Sci.,2000
3. Parameterized inapproximability of target set selection and generalizations;Bazgan,2014
4. Treewidth governs the complexity of target set selection;Ben-Zwi;Discrete Optim.,2011
5. Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph;Bhaskara,2010
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献