✦ LIBER ✦

Pseudofree actions and the greedy algorithm

✍ Scribed by R. E. Stong

Publisher: Springer
Year: 1983
Tongue: English
Weight: 505 KB
Volume: 265
Category: Article
ISSN: 0025-5831
DOI: 10.1007/bf01455950

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pseudofree actions and Hurwitz's 84(g−1)

Pseudofree actions and Hurwitz's 84(g−1) theorem

✍ R. S. Kulkarni 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 989 KB

The Thresholding Greedy Algorithm, Greed

The Thresholding Greedy Algorithm, Greedy Bases, and Duality

✍ S.J. Dilworth; N.J. Kalton; Denka Kutzarova; V.N. Temlyakov 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 199 KB

Matroids and the greedy algorithm

✍ Jack Edmonds 📂 Article 📅 1971 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

The canonical order and greedy algorithm

The canonical order and greedy algorithms

✍ M.M. Kovalev; D.M. Vasilkov 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 220 KB

The greedy load sharing algorithm

✍ Shyamal Chowdhury 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 788 KB

Asymptotic packing and the random greedy

Asymptotic packing and the random greedy algorithm

✍ Vojtěch Rödl; Luboš Thoma 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB

Let H be an r-uniform hypergraph satisfying deg(x) = D(l + o( 1)) for each vertex x E V ( H ) and deg(x, y) = o ( D ) for each pair of vertices x, y E V ( H ) , where D+=. Recently, J . Spencer [5] showed, using a branching process approach, that almost surely the random greedy algorithm finds a pac