Efficient Sequences of Trials (2003) [11 citations — 1 self]
by
Edith Cohen
,
Amos Fiat
,
Haim Kaplan
,
Evelle J. Younger
,
La Times
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Cohen03efficientsequences,
author = {Edith Cohen and Amos Fiat and Haim Kaplan and Evelle J. Younger and La Times},
title = {Efficient Sequences of Trials},
year = {2003}
}
author = {Edith Cohen and Amos Fiat and Haim Kaplan and Evelle J. Younger and La Times},
title = {Efficient Sequences of Trials},
year = {2003}
}
Years of Citing Articles
Bookmarks
OpenURL
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 heterogeneous search environments such as peer to peer networks.
Citations
| 389 | A threshold of ln n for approximating set cover – Feige - 1998 |
| 351 | Search and replication in unstructured peer-to-peer networks – Lv, Cao, et al. - 2002 |
| 241 | A greedy heuristic for the set-covering problem – Chvátal - 1979 |
| 180 | On the ratio of optimal integral and fractional covers – Lova'sz - 1975 |
| 156 | Replication strategies in unstructured peer-to-peer networks – Cohen, Shenker - 2002 |
| 58 | Associative search in peer to peer networks: Harnessing latent semantics – Cohen, Fiat, et al. - 2007 |
| 10 | A case for associative peer to peer overlays – Cohen, Fiat, et al. - 2003 |
