The Robust Set Problem: Parameterized Complexity and Approximation


In this paper, we introduce the k-Robust Set problem: given a graph G = (V,E), a threshold function t : V → N and an integer k, find a subset of vertices V ′ ⊆ V of size at least k such that every vertex v in G has less than t(v) neighbors in V ′. This problem occurs in the context of the spread of undesirable agents through a network (virus, ideas, fire… (More)
DOI: 10.1007/978-3-642-32589-2_15

1 Figure or Table


  • Presentations referencing similar topics