Sciweavers

6 search results - page 2 / 2
» Private Approximation of Clustering and Vertex Cover
Sort
View
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 3 months ago
On Tractable Cases of Target Set Selection
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...
André Nichterlein, Rolf Niedermeier, Johann...