期刊文献+

Dynamic Dominating Set and Turbo-Charging Greedy Heuristics

Dynamic Dominating Set and Turbo-Charging Greedy Heuristics
原文传递
导出
摘要 The main purpose of this paper is to exposit two very different, but very general, motivational schemes in the art of parameterization and a concrete example connecting them. We introduce a dynamic version of the DOMINATING SET problem and prove that it is fixed-parameter tractable(FPT). The problem is motivated by settings where problem instances evolve. It also arises in the quest to improve a natural greedy heuristic for the DOMINATING SET problem. The main purpose of this paper is to exposit two very different, but very general, motivational schemes in the art of parameterization and a concrete example connecting them. We introduce a dynamic version of the DOMINATING SET problem and prove that it is fixed-parameter tractable(FPT). The problem is motivated by settings where problem instances evolve. It also arises in the quest to improve a natural greedy heuristic for the DOMINATING SET problem.
出处 《Tsinghua Science and Technology》 SCIE EI CAS 2014年第4期329-337,共9页 清华大学学报(自然科学版(英文版)
基金 supported by the Australian Research Council
关键词 kernelization multivariate algorithms parameterized algorithms turbo-charging heuristics kernelization multivariate algorithms parameterized algorithms turbo-charging heuristics
  • 相关文献

参考文献30

  • 1R.M.Karp,Heuristic algorithms in computational molecular biology,J.Comput.Syst.Sci.,vol.77,no.1,pp.122-128,2011.
  • 2L.Cai,J.Chen,R.G.Downey,and M.R.Fellows,On the structure of parameterized problems in NP,Inf Comput.,vol.123,no.1,pp.38-49,1995.
  • 3L.Cai,J.Chen,R.G.Downey,and M.R.Fellows,Advice classes of parameterized tractability,Ann.Pure Appl.Logic,vol.84,no.l,pp.119-138,1997.
  • 4L.Cai,J.Chen,R.G.Downey,and M.R.Fellows,On the parameterized complexity of short computation and factorization,Arch.Math.Log.,vol.36,nos.4-5,pp.321-337,1997.
  • 5J.Chen,Randomized disposal of unknowns and implicitly enforced bounds on parameters,in IWPEC,2008,pp.1-8.
  • 6J.Chen,Vertex cover kernelization,in Encyclopedia of Algorithms,M.Y.Kao,ed.Springer,2008.
  • 7J.Chen,Maximum partition matching,in Encyclopedia of Opti-Mization.Kluwer Academic Publishers,2009,pp.2029-2035.
  • 8J.Chen and S.B.Cooper,Algorithms,complexity and computational models,Theor.Comput.Sci.,vol.412,no.23,pp.2457-2458,2011.
  • 9J.Chen,H.Fernau,I.A.Kanj,and G.Xia,Parametric duality and kernelization:Lower bounds and upper bounds on kernel size,in STACS,2005,pp.269-280.
  • 10J.Chen and I.A.Kanj,Parameterized complexity and subexponential-time computability,in The Multivariate Algorithmic Revolution and Beyond,2012,pp.162-195.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部