Probabilistic analysis of packing and partitioning algorithms

✍ Scribed by E. G. Coffman, George S. Lueker

Publisher: John Wiley & Sons
Year: 1991
Tongue: English
Leaves: 202
Series: Wiley-Interscience Series in Discrete Mathematics and Optimization
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

This is a theoretical analysis of a probabilistic approach to solving packing or partitioning algorithms. These generally require the partitioning of a set of nonnegative numbers so that the sums of the elements in the blocks of the partition satisfy some given property. Departs from previous research on these types of algorithms in that it takes a probabilistic rather than a heuristic approach to solving them.

✦ Subjects

Математика;Теория вероятностей и математическая статистика;Теория вероятностей;

📜 SIMILAR VOLUMES

Probabilistic analysis of some searching

📁 Probabilistic analysis of some searching and sorting algorithms

✍ Lent J. 📂 Library 📅 1996 🌐 English

We use binary trees to analyze two algorithms, insertion sort and multiple quckselect. In each case, we consider the number of comparisons consumed as a measure of performance. We assume that the ranks of the n data values being searched or sorted form a random permutation of the integers {l,...,n}.

Probability and Computing: Randomized Al

📁 Probability and Computing: Randomized Algorithms and Probabilistic Analysis

✍ Michael Mitzenmacher, Eli Upfal 📂 Library 📅 2005 🏛 Cambridge University Press 🌐 English

Assuming only an elementary background in discrete mathematics, this textbook is an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It includes random sampling, expectations, Markov's and Chevyshev's inequalities,

Probability and computing: randomized al

📁 Probability and computing: randomized algorithms and probabilistic analysis

✍ Michael Mitzenmacher; Eli Upfal 📂 Library 📅 2005 🏛 Cambridge University Press 🌐 English

"This textbook is designed to accompany a one- or two-semester course for advanced undergraduates or beginning graduate students in computer science and applied mathematics. It gives an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic a

Probability and Computing: Randomized Al

📁 Probability and Computing: Randomized Algorithms and Probabilistic Analysis

✍ Michael Mitzenmacher, Eli Upfal 📂 Library 📅 2005 🏛 Cambridge University Press 🌐 English

Probabilistic analysi of sorting algorit

📁 Probabilistic analysi of sorting algorithms. Lecture notes

✍ Hitczenko P. 📂 Library 🌐 English

Probabilistic Analysis of Algorithms: On

📁 Probabilistic Analysis of Algorithms: On Computing Methodologies for Computer Algorithms Performance Evaluation

✍ Micha Hofri 📂 Library 📅 1987 🏛 Springer 🌐 English

<p><I>Probabilistic Analysis of Algorithms</I> begins with a presentation of the "tools of the trade" currently used in probabilistic analyses, and continues with an applications section in which these tools are used in the analysis ofr selected algorithms. The tools section of the book provides the