1332 search results - page 8 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
STOC
2000
ACM
13 years 11 months ago
2000
ACM
We consider a new model for computing with uncertainty. It is desired to compute a function f X1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
IPL
2006
13 years 7 months ago
2006
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
IPCO
1993
13 years 8 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...