A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...