On a universal best choice algorithm for partially ordered sets
Random Structures and Algorithms2007Vol. 32(3), pp. 263–273
Citations Over TimeTop 18% of 2007 papers
Abstract
Abstract For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lower bound of its chance of success from the hitherto known constant 1/8 to 1/4. We also show that this result is the best possible for this algorithm, i.e., the 1/4 bound cannot be further improved. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008
Related Papers
- → On Almost α(Λ, sp)-continuous Multifunctions(2022)5 cited
- → Prim�rzerlegung in Steinschen Algebren(1964)32 cited
- → �ber unirationale Scharen auf algebraischen Mannigfaltigkeiten(1966)4 cited
- Susquehanna Chorale Spring Concert "Roots and Wings"(2017)
- → Algebraic Set Operations, Multifunctions, and Indefinite Integrals(1996)