Sciweavers

57 search results - page 1 / 12
» On Tractable Cases of Target Set Selection
Sort
View
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 2 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...
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
13 years 11 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 2 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
GRAPHICSINTERFACE
2004
13 years 5 months ago
The Effects of Feedback on Targeting with Multiple Moving Targets
A number of task settings involve selection of objects from dynamic visual environments with multiple moving targets. Target selection is difficult in these settings because objec...
David Mould, Carl Gutwin
LWA
2008
13 years 5 months ago
Enhanced Services for Targeted Information Retrieval by Event Extraction and Data Mining
Where Information Retrieval (IR) and Text Categorization delivers a set of (ranked) documents according to a query, users of large document collections would rather like to receiv...
Felix Jungermann, Katharina Morik