Efficient sequences of trials

Edith Cohen, Amos Fiat, Haim Kaplan

Abstract

We introduce a problem called sequential trial optimization, a generalization of the well studied set cover problem with a new objective function. We give a simple algorithm that achieves a constant factor approximation to this problem. Sequential trial optimization naturally arises in heterogenous search environments such as peer to peer networks.
BibTeX
@inproceedings{cohen2003efficient,
  author = {Edith Cohen and Amos Fiat and Haim Kaplan},
  title = {{Efficient sequences of trials}},
  booktitle = {SODA},
  year = {2003},
}

Loading related content...

Figure