✦ LIBER ✦

The greedy algorithm is optimal for on-line edge coloring

✍ Scribed by Amotz Bar-Noy; Rajeev Motwani; Joseph Naor

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note: On the greedy algorithm for optima

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

A simple optimal parallel algorithm for

✍ Ming-Shing Yu; Cheng-Hsing Yang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 398 KB

The sequential sum problem and performan

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

Average performance of a greedy algorith

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

An average case analysis of a greedy alg

✍ Ying Teh Tsai; Chuan Yi Tang; Yunn Yen Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 719 KB