✦ LIBER ✦

Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set

✍ Scribed by Lang, Kevin J.

Book ID: 125342492
Publisher: Springer
Year: 2013
Tongue: English
Weight: 1007 KB
Volume: 54
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-013-9496-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear selection algorithm for sets of

A linear selection algorithm for sets of elements with weights

✍ Angelika Reiser 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 376 KB

A({{10}})-Approximation Algorithm for a

A({{10}})-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem

✍ Robert Carr; Toshihiro Fujito; Goran Konjevod; Ojas Parekh 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 85 KB

A parallel algorithm for generating mult

A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs

✍ Ma Jun; Ma Shaohan; Kazuo Iwama; Gu Qianping 📂 Article 📅 1999 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 441 KB

The analysis of some algorithms for gene

The analysis of some algorithms for generating random variates with a given hazard rate

✍ Luc Devroye 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

A general algorithm for simulation of ra

A general algorithm for simulation of random variables

✍ V. A. Kanevskii 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 378 KB

A generalization of the weighted set cov

A generalization of the weighted set covering problem

✍ Jian Yang; Joseph Y-T. Leung 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,