Skip to main content

2 Result(s)

within Computer Science Remove this filter Data Structures and Information Theory Remove this filter Pranabendu Misra Remove this filter Chapter Remove this filter

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)

  2. No Access

    Chapter and Conference Paper

    An ETH-Tight Algorithm for Bidirected Steiner Connectivity

    In the Strongly Connected Steiner Subgraph problem, we are given an n-vertex digraph D, a weight function \(w:A(D)\mapsto {\mathbb {R}}^+\) ...

    Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan… in Algorithms and Data Structures (2023)