Search Results for author:
Found 2 papers, 2 papers with code
Threshold Treewidth and Hypertree Width
However, here the order of the polynomial in the running time depends on the width, and this is known to be unavoidable; therefore, the problem is not fixed-parameter tractable parameterized by either of these width measures.
Solving the Steiner Tree Problem with few Terminals
We show that admissibility is indeed weaker than consistency and establish correctness of the DS* algorithm when using an admissible heuristic function.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
