Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

摘要

rithms for these problems. Our algorithms run in time O(n + 2~(O(k))), an improvement over previous algorithms for some of these problems running in time O(n + k~(O(k))). The flexibility of our approach allows tuning of algorithms to obtain smaller constants in the exponent.