An introductory and selective review is presented of results obtained through a probabilistic analysis of combinatorial algorithms. The emphasis is on asymptotic characteristics of optimal solution values, and on the relative and absolute error analysis for simple heuristics
This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These ...
We present an analytical method of analyzing a class of "splitting algorithms" that includ...
This report documents the program and the outcomes of Dagstuhl Seminar 17141 "Probabilistic Methods ...
Ouvrage (auteur).This book presents a large variety of applications of probability theory and statis...
AbstractA simple combinatorial approach is given for handling certain conditioning problems that ari...
AbstractMany probabilistic properties of elementary discrete combinatorial structures of interest fo...
This paper discusses the applications of certain combinatorial and probabilistic techniques to the a...
UnrestrictedAn algorithm can be defined as a set of computational steps that transform the input to ...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988.Includes bibliogr...
Cette thèse est dédiée à l'étude d'une large classe d'algorithmes, appelés algorithmes en arbre. En ...
In this thesis a general class of tree algorithms is analyzed. It is shown that, by using an appropr...
A simple combinatorial approach is given for handling certain conditioning problems that arise in th...
Since the introduction of mathematical programming it has been all too easy to identify real-world p...
The statistical assessment of the empirical comparison of algorithms is an essential step in heurist...
We present a new research domain in Operational Research, probabilistic combinatorial optimization p...
This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These ...
We present an analytical method of analyzing a class of "splitting algorithms" that includ...
This report documents the program and the outcomes of Dagstuhl Seminar 17141 "Probabilistic Methods ...
Ouvrage (auteur).This book presents a large variety of applications of probability theory and statis...
AbstractA simple combinatorial approach is given for handling certain conditioning problems that ari...
AbstractMany probabilistic properties of elementary discrete combinatorial structures of interest fo...
This paper discusses the applications of certain combinatorial and probabilistic techniques to the a...
UnrestrictedAn algorithm can be defined as a set of computational steps that transform the input to ...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988.Includes bibliogr...
Cette thèse est dédiée à l'étude d'une large classe d'algorithmes, appelés algorithmes en arbre. En ...
In this thesis a general class of tree algorithms is analyzed. It is shown that, by using an appropr...
A simple combinatorial approach is given for handling certain conditioning problems that arise in th...
Since the introduction of mathematical programming it has been all too easy to identify real-world p...
The statistical assessment of the empirical comparison of algorithms is an essential step in heurist...
We present a new research domain in Operational Research, probabilistic combinatorial optimization p...
This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These ...
We present an analytical method of analyzing a class of "splitting algorithms" that includ...
This report documents the program and the outcomes of Dagstuhl Seminar 17141 "Probabilistic Methods ...
DOI
Add to ORKG