Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Parameterized Approximation Algorithms for Weighted Vertex Cover

    A vertex cover of a graph is a set of vertices of the graph such that every edge has at least one endpoint in it. In this work, we study Weighted Vertex Cover with solution size as a parameter. Formally, in the ...

    Soumen Mandal, Pranabendu Misra, Ashutosh Rai in LATIN 2024: Theoretical Informatics (2024)