DOAJ
Open Access
2007
Randomized Optimization: a Probabilistic Analysis
Jean Cardinal
Stefan Langerman
Guy Louchard
Abstrak
In 1999, Chan proposed an algorithm to solve a given optimization problem: express the solution as the minimum of the solutions of several subproblems and apply the classical randomized algorithm for finding the minimum of $r$ numbers. If the decision versions of the subproblems are easier to solve than the subproblems themselves, then a faster algorithm for the optimization problem may be obtained with randomization. In this paper we present a precise probabilistic analysis of Chan's technique.
Topik & Kata Kunci
Penulis (3)
J
Jean Cardinal
S
Stefan Langerman
G
Guy Louchard
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2007
- Sumber Database
- DOAJ
- DOI
- 10.46298/dmtcs.3540
- Akses
- Open Access ✓