A multivariate framework for weighted FPT algorithms

@article{Shachnai2017AMF,
  title={A multivariate framework for weighted FPT algorithms},
  author={Hadas Shachnai and Meirav Zehavi},
  journal={J. Comput. Syst. Sci.},
  year={2017},
  volume={89},
  pages={157-189}
}
  • Hadas Shachnai, Meirav Zehavi
  • Published 2017
  • Mathematics, Computer Science
  • J. Comput. Syst. Sci.
  • We introduce a novel multivariate approach for solving weighted parameterized problems. In our model, given an instance of size $n$ of a minimization (maximization) problem, and a parameter $W \geq 1$, we seek a solution of weight at most (or at least) $W$. We use our general framework to obtain efficient algorithms for such fundamental graph problems as Vertex Cover, 3-Hitting Set, Edge Dominating Set and Max Internal Out-Branching. The best known algorithms for these problems admit running… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-6 OF 6 CITATIONS

    Weighted vertex cover on graphs with maximum degree 3

    VIEW 5 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Maximization Problems Parameterized Using Their Minimization Versions: The Case of Vertex Cover

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    Maximum Minimal Vertex Cover Parameterized by Vertex Cover

    • Meirav Zehavi
    • Computer Science, Mathematics
    • SIAM J. Discret. Math.
    • 2017

    References

    Publications referenced by this paper.