𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved analysis of the greedy algorithm for stochastic matching

✍ Scribed by Marek Adamczyk

Book ID
108154775
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
171 KB
Volume
111
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improved performance of the greedy algor
Improved performance of the greedy algorithm for partial cover
✍ Petr SlavΓ­k πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 332 KB

We prove that the classical bounds on the performance of the greedy algorithm for approximating MINIMUM COVER with costs are valid for PARTIAL. COVER as well, thus lowering, by more than a factor of two, the previously known estimate. In order to do so, we introduce a new simple technique that might

A Tight Analysis of the Greedy Algorithm
A Tight Analysis of the Greedy Algorithm for Set Cover
✍ Petr Slavı́k πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 214 KB

We establish significantly improved bounds on the performance of the greedy algorithm for approximating set co¨er. In particular, we provide the first substantial Ž . improvement of the 20-year-old classical harmonic upper bound, H m , of Johnson, Lovasz, and Chvatal, by showing that the performance

Worst case analysis of a greedy algorith
Worst case analysis of a greedy algorithm for graph thickness
✍ Sinichiro Kawano; Koichi Yamazaki πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 208 KB

In this paper, we consider a greedy algorithm for thickness of graphs. The greedy algorithm we consider here takes a maximum planar subgraph away from the current graph in each iteration and repeats this process until the current graph has no edge. The greedy algorithm outputs the number of iteratio