6 citations · 14 across the 31 of their papers we have counts for
5 papers · 1 filter
Target Set Selection parameterized by vertex cover and more
Suman Banerjee, Rogers Mathew, Fahad Panolan
Given a simple, undirected graph with a threshold function , the \textsc{Target Set Selection} (TSS) problem is about choosing a minimum cardinal…
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments
Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee +3
A {\em tournament} is a directed graph such that every pair of vertices is connected by an arc. A {\em feedback vertex set} is a set of vertices in such that is…
Approximation Schemes for Low-Rank Binary Matrix Approximation Problems
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov +2
We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering p…
Parameterized Low-Rank Binary Matrix Approximation
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
We provide a number of algorithmic results for the following family of problems: For a given binary m\times n matrix A and integer k, decide whether there is a "simple" binary matr…
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
Eduard Eiben, Dušan Knop, Fahad Panolan +1
In the Directed Steiner Network problem we are given an arc-weighted digraph , a set of terminals , and an (unweighted) directed request graph with $V(R)=T…