3422 search results - page 3 / 685 » Random Subset Optimization |
SODA
2004
ACM
13 years 7 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
RSA
2002
13 years 5 months ago
2002
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
SAC
2004
ACM
13 years 11 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
WEA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...