Author:
Abu-Khzam Faisal N.,Lamm Sebastian,Mnich Matthias,Noe Alexander,Schulz Christian,Strash Darren
Abstract
AbstractOver the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has resulted in an algorithmic toolbox that is by now well-established. However, these theoretical algorithmic ideas have received very little attention from the practical perspective. We survey recent trends in data reduction engineering results for selected problems. Moreover, we describe concrete techniques that may be useful for future implementations in the area and give open problems and research questions.
Publisher
Springer Nature Switzerland
Reference173 articles.
1. Abello, J., Pardalos, P.M., Resende, M.: On maximum clique problems in very large graphs. In: External Memory Algorithms, pp. 119–130 (1999). https://doi.org/10.1090/dimacs/050/06
2. Abu-Khzam, F.N.: A kernelization algorithm for $$d$$-hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010). https://doi.org/10.1016/j.jcss.2009.09.002
3. Abu-Khzam, F.N.: On the complexity of multi-parameterized cluster editing. J. Discrete Algor. 45, 26–34 (2017). https://doi.org/10.1016/j.jda.2017.07.003
4. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Proceedings of ALENEX/ANALCO, pp. 62–69 (2004)
5. Akiba, T., Iwata, Y.: Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover. Theore. Comput. Sci. 609, Part 1, 211–225 (2016). https://doi.org/10.1016/j.tcs.2015.09.023
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献