Author:
Brimkov Boris,Fast Caleb C.,Hicks Illya V.
Funder
National Science Foundation
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference60 articles.
1. Aazami, A. (2008). Hardness results and approximation algorithms for some problems on graphs. Ph.D. thesis, University of Waterloo.
2. Domination in graphs with bounded propagation: algorithms, formulations and hardness results;Aazami;Journal of Combinatorial Optimization,2010
3. Combinatorial model and bounds for target set selection;Ackerman;Theoretical Computer Science,2010
4. Upper bounds on the k-forcing number of a graph;Amos;Discrete Applied Mathematics,2015
5. Computational experience with general cutting planes for the set covering problem;Avella;Operations Research Letters,2009
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献