✦ LIBER ✦

Performance guarantees of greedy algorithms for the problems on hereditary systems

✍ Scribed by V. P. Il’ev

Book ID: 111471212
Publisher: Pleiades Publishing
Year: 2009
Tongue: English
Weight: 552 KB
Volume: 3
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s1990478909010098

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A performance guarantee for the greedy s

A performance guarantee for the greedy set-partitioning algorithm

✍ E. G. Coffman; M. A. Langston 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 355 KB

The sequential sum problem and performan

The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem

✍ Zevi Miller; Dan Pritikin; Manley Perkel; I.H. Sudborough 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 331 KB

Average performance of a greedy algorith

Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space

✍ Ying The Tsai; Chuan Yi Tang; Yunn Yen Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 469 KB

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

Approximation Algorithms with Bounded Pe

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem

✍ N. Guttmann-Beck; R. Hassin; S. Khuller; B. Raghavachari 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 111 KB

A note on the greedy algorithm for the u

A note on the greedy algorithm for the unsplittable flow problem

✍ Petr Kolman 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 161 KB

In a recent paper Chekuri and Khanna improved the analysis of the greedy algorithm for the edge disjoint paths problem and proved the same bounds also for the related uniform capacity unsplittable flow problem. Here we show that their ideas can be used to get the same approximation ratio even for th