A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Adaptive ordering of pipelined stream filters
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Packet classification in large ISPs: design and evaluation of decision tree classifiers
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Flow algorithms for two pipelined filter ordering problems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Associative search in peer to peer networks: Harnessing latent semantics
Computer Networks: The International Journal of Computer and Telecommunications Networking
A generic flow algorithm for shared filter ordering problems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
IEEE/ACM Transactions on Networking (TON)
Algorithms for distributional and adversarial pipelined filter ordering problems
ACM Transactions on Algorithms (TALG)
Proceedings of the forty-first annual ACM symposium on Theory of computing
A constant factor approximation algorithm for generalized min-sum set cover
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Paging multiple users in cellular network: yellow page and conference call problems
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
The pipelined set cover problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
| Hi-index | 0.00 |
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.