Automated Generation of Search Tree Algorithms for Graph Modification Problems
We present a (seemingly first) framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold—rapid development and improved upper bounds. Many search tree algorithms for various problems in the literature are based on complicated case distinctions. Our approach may lead to a much simpler process of developing and analyzing these algorithms. Moreover, using the sheer computing power of machines it may also lead to improved upper bounds on search tree sizes (i.e., faster exact solving algorithms) in comparison with previously developed “hand-made” search trees.
KeywordsSearch Tree Automate Generation Vertex Cover Input Graph Reduction Rule
Unable to display preview. Download preview PDF.
- 3.Dahllöf, V., Jonsson, P.: An algorithm for counting maximum weighted independent sets and its applications. In: Proc. 13th ACM SODA, pp. 292–298 (2002)Google Scholar
- 5.Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Graph-modeled data clustering: fixed-parameter algorithms for clique generation. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653, pp. 108–119. Springer, Heidelberg (2003)Google Scholar
- 8.McKay, B.D.: nauty user’s guide (version 1.5). Technical report TR-CS-90-02, Australian National University, Department of Computer Science (1990)Google Scholar
- 10.Niedermeier, R., Rossmanith, P.: An efficient fixed parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms (2003) (to appear)Google Scholar