✦ LIBER ✦

A probabilistic analysis of some greedy cardinality matching algorithms

✍ Scribed by G. Tinhofer

Book ID: 112644122
Publisher: Springer US
Year: 1984
Tongue: English
Weight: 437 KB
Volume: 1
Category: Article
ISSN: 0254-5330
DOI: 10.1007/bf01874391

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved analysis of the greedy algorith

Improved analysis of the greedy algorithm for stochastic matching

✍ Marek Adamczyk 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Music Structure Analysis Using a Probabi

Music Structure Analysis Using a Probabilistic Fitness Measure and a Greedy Search Algorithm

✍ Paulus, J.; Klapuri, A. 📂 Article 📅 2009 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 704 KB

Some recent results in the analysis of g

Some recent results in the analysis of greedy algorithms for assignment problems

✍ Ulrich Faigle 📂 Article 📅 1994 🏛 Springer 🌐 German ⚖ 809 KB

A greedy algorithm for some classes of i

A greedy algorithm for some classes of integer programs

✍ V.V. Shenmaier 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 144 KB

We establish a necessary and su cient condition for a greedy algorithm to ÿnd an optimal solution in the case of integer programs with separable concave objective functions. This extends some well-known results for spanning trees, matroids, and greedoids. As a corollary we obtain one new generalizat

On some conditioning results in the prob

On some conditioning results in the probabilistic analysis of algorithms

✍ Colin McDiarmid 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 268 KB

A Statistical Analysis of Probabilistic

A Statistical Analysis of Probabilistic Counting Algorithms

✍ PETER CLIFFORD; IOANA A. COSMA 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB