arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.09912cs.DScs.DM
收藏

PACE求解器描述:Bute-Plus:一个自下而上的树深度精确求解器

PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth

James Trimble

摘要:

本文介绍了Bute-Plus,一个精确的树深问题求解器。求解器的核心是一个正例驱动的动态程序,它以自自底向上的【形】的方式构造一个最小深度的消除树。这三个特性大大提高了算法的运行时间。第一种是专门的trie数据结构。第二个是支配规则。第三个是启发式的预解步骤,可以快速找到一个树深度分解的最佳深度为许多实例。

英文摘要:

This note introduces Bute-Plus, an exact solver for the treedepth problem. The core of the solver is a positive-instance driven dynamic program that constructs an elimination tree of minimum depth in a bottom-up fashion. Three features greatly improve the algorithm's run time. The first of these is a specialised trie data structure. The second is a domination rule. The third is a heuristic presolve step can quickly find a treedepth decomposition of optimal depth for many instances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑