1671 search results - page 107 / 335 » On the Covering Steiner Problem |
113
Voted
ALGORITHMICA
2008
15 years 29 days ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
106
click to vote
DATE
2004
IEEE
15 years 4 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
101
click to vote
SIAMJO
2000
15 years 18 days ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
96
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
127
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...