Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
暂无分享,去创建一个
[1] Leizhen Cai,et al. Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems , 2006, IWPEC.
[2] Stephen G. Hartke. Attempting to Narrow the Integrality Gap for the Firefighter Problem on Trees , 2004, Discrete Methods in Epidemiology.
[3] Russell Impagliazzo,et al. On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..
[4] Cai,et al. The Surviving Rate of a Graph , 2007 .
[5] Stephen G. Hartke,et al. Fire containment in grids of dimension three and higher , 2007, Discret. Appl. Math..
[6] Aravind Srinivasan,et al. Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[7] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[8] Michael A. Langston,et al. Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings , 2006, IWPEC.
[9] Gary MacGillivray,et al. The firefighter problem for graphs of maximum degree three , 2007, Discret. Math..
[10] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..