Your access to this publication is provided through the subscription of Universitat Bremen

SIAM Journal on Computing


Volume 9, Issue 1

An Efficient Method for Weighted Sampling without Replacement

Related Databases

Web of Science

You must be logged in with an active subscription to view this.

Article Data

History

Submitted: 07  July  1978
Published online: 13 July 2006

Publication Data

ISSN (print): 0097-5397
ISSN (online): 1095-7111
CODEN: smjcat

In this note, an efficient method for weighted sampling of K objects without replacement from a population of n objects is proposed. The method requires $O(K\log n)$ additions and comparisons, and $O(K)$ multiplications and random number generations while the method proposed by Fagin and Price requires $O(Kn)$ additions and comparisons, and $O(K)$ divisions and random number generations.

Copyright © 1980 Society for Industrial and Applied Mathematics

Cited by

(2013) Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set. Theory of Computing Systems CrossRef
(2010) A Hybrid Nested Partitions Algorithm for Banking Facility Location Problems. IEEE Transactions on Automation Science and Engineering 7:3, 654-658 CrossRef
(2008) Hybrid Nested Partitions and Mathematical Programming Approach and Its Applications. IEEE Transactions on Automation Science and Engineering 5:4, 573-586 CrossRef
(2008) Synchronous parallel kinetic Monte Carlo for continuum diffusion-reaction systems. Journal of Computational Physics 227:8, 3804-3823 CrossRef
(2007) Synchronous relaxation algorithm for parallel kinetic Monte Carlo simulations of thin film growth. Physical Review E 75:1, CrossRef
(2006) Weighted random sampling with a reservoir. Information Processing Letters 97:5, 181-185 CrossRef
(1998) The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms. Probability in the Engineering and Informational Sciences 12:03, 283 CrossRef
(1995) Random sampling from databases: a survey. Statistics and Computing 5:1, 25-42 CrossRef
(1992) Bounding the variance in Monte Carlo experiments. Operations Research Letters 11:4, 243-248 CrossRef
(1990) Generating random combinatorial objects. Journal of Algorithms 11:2, 185-207 CrossRef