Efficient sequences of trials

Edith Cohen; Amos Fiat; Haim Kaplan

Efficient sequences of trials

Edith Cohen^*
, Amos Fiat
, Haim Kaplan

^*Corresponding author for this work

School of Computer Science and AI

AT&T

Research output: Contribution to conference › Paper › peer-review

24 Scopus citations

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.

Original language	English
Pages	737-746
Number of pages	10
State	Published - 2003
Event	Configuralble Computing: Technology and Applications - Boston, MA, United States Duration: 2 Nov 1998 → 3 Nov 1998

Conference

Conference	Configuralble Computing: Technology and Applications
Country/Territory	United States
City	Boston, MA
Period	2/11/98 → 3/11/98

Cite this

@conference{c5926065c747449997eda223e544c0d2,

title = "Efficient sequences of trials",

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.",

author = "Edith Cohen and Amos Fiat and Haim Kaplan",

year = "2003",

language = "אנגלית",

pages = "737--746",

note = "Configuralble Computing: Technology and Applications ; Conference date: 02-11-1998 Through 03-11-1998",

}

TY - CONF

T1 - Efficient sequences of trials

AU - Cohen, Edith

AU - Fiat, Amos

AU - Kaplan, Haim

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0038077464

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0038077464

SP - 737

EP - 746

T2 - Configuralble Computing: Technology and Applications

Y2 - 2 November 1998 through 3 November 1998

ER -

Efficient sequences of trials

Abstract

Conference

Other files and links

Fingerprint

Cite this