✦ LIBER ✦

Greedy Modifications of OAC-triclustering Algorithm

✍ Scribed by Gnatyshak, Dmitry V.

Book ID: 124129188
Publisher: Elsevier
Year: 2014
Tongue: English
Weight: 202 KB
Volume: 31
Category: Article
ISSN: 1877-0509
DOI: 10.1016/j.procs.2014.05.367

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A modification of the greedy algorithm f

A modification of the greedy algorithm for vertex cover

✍ Kenneth L. Clarkson 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Realizability of greedy algorithms

✍ E. D. Livshits 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 377 KB

Rate of Convergence of Greedy Algorithms

✍ A. V. Sil'nichenko 📂 Article 📅 2004 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 103 KB

Comparison of the convergence rate of pu

Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms

✍ A. V. Dereventsov 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 499 KB

Rate of Convergence of Pure Greedy Algor

Rate of Convergence of Pure Greedy Algorithms

✍ E. D. Livshits 📂 Article 📅 2004 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 162 KB

A disturbed version of the greedy algori

A disturbed version of the greedy algorithm

✍ W. Wenzel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

We study a disturbed variant of the classical greedy algorithm for weight functions defined on some given finite set E and show that the greedy algorithm for matroids is stable with respect to changes in the input data.