# Tag Info

## New answers tagged fixed-parameter-tractable

0

The answer is yes. There is a dynamic programming algorithm that runs in time $O^*(3^k)$. It is a generalization of Dreyfus and Wagner's well-known algorithm for Steiner tree.

Top 50 recent answers are included