✦ LIBER ✦

A greedy algorithm for the optimal basis problem

✍ Scribed by Oleg Burdakov

Book ID: 110543692
Publisher: Springer Netherlands
Year: 1997
Tongue: English
Weight: 455 KB
Volume: 37
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf02510241

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note: On the greedy algorithm for optima

Note: On the greedy algorithm for optimal assembly

✍ Laurence A. Baxter; Farid Harche 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

A greedy reduction algorithm for setup o

A greedy reduction algorithm for setup optimization

✍ Ulrich Faigle; Rainer Schrader 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 533 KB

A new greedy algorithm for the quadratic

A new greedy algorithm for the quadratic assignment problem

✍ Theodoros P. Gevezes, Leonidas S. Pitsoulis 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 463 KB

Optimal greedy algorithms for indifferen

Optimal greedy algorithms for indifference graphs

✍ Peter J. Looges; Stephan Olariu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 658 KB

Greedy algorithm for the general multidi

Greedy algorithm for the general multidimensional knapsack problem

✍ Yalçın Akçay; Haijun Li; Susan H. Xu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 328 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