Sciweavers

4488 search results - page 110 / 898
» Properties of NP-Complete Sets
Sort
View
TPDS
2002
155views more  TPDS 2002»
13 years 7 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
Jie Wu
ARSCOM
2007
63views more  ARSCOM 2007»
13 years 8 months ago
Towards a Characterisation of Lottery Set Overlapping Structures
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
Alewyn P. Burger, W. R. Grundlingh, Jan H. van Vuu...
BMCBI
2008
173views more  BMCBI 2008»
13 years 8 months ago
Gene Vector Analysis (Geneva): A unified method to detect differentially-regulated gene sets and similar microarray experiments
Background: Microarray experiments measure changes in the expression of thousands of genes. The resulting lists of genes with changes in expression are then searched for biologica...
Stephen W. Tanner, Pankaj Agarwal
COMPGEOM
2009
ACM
14 years 2 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 2 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...