503 search results - page 42 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
166
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
149
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
151
click to vote
DAM
2007
15 years 5 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
158
click to vote
SECON
2007
IEEE
16 years 6 days ago
2007
IEEE
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
153
click to vote
AICCSA
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree tha...