4377 search results - page 31 / 876 » Mass problems and randomness |
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
86
Voted
CPC
2007
14 years 9 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
WEA
2004
Springer
15 years 3 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...
MOBIHOC
2003
ACM
15 years 9 months ago
2003
ACM