Weighted vertex cover on graphs with maximum degree 3. (arXiv:1810.12982v1 [cs.DS])

We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is $O^*(1.402^t)$, where $t$ is the minimum size of a vertex cover of the input graph.

from cs updates on arXiv.org https://ift.tt/2AEDm9X
//