Many real-world problems are NP-hard;to solve them, usually heuristics are used. Parameterized Complexity is a recent approach that tries to exploit structures of real-world problem instances. The aim of the work was ...
详细信息
Many real-world problems are NP-hard;to solve them, usually heuristics are used. Parameterized Complexity is a recent approach that tries to exploit structures of real-world problem instances. The aim of the work was to establish that Parameterized Complexity, and in particular novel algorithmic techniques whose development was driven by this concept, can actually lead to practically useful programs for exactly solving real-world problem instances. We show this here using the example of Clique Cover und Minimum-Weight Path, which have applications in computational biology and other areas.
暂无评论