𝔖 Bobbio Scriptorium

✦ LIBER ✦

An approximation algorithm for maximum packing of 3-edge paths

✍ Scribed by Refael Hassin; Shlomi Rubinstein

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 354 KB
Volume: 63
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00097-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for covering a

Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight

✍ Shlomo Moran; Ilan Newman; Yaron Wolfstahl 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 464 KB

An algorithm and a program for choosing

An algorithm and a program for choosing an approximating equation with the maximum degree of correlation: Pavelko, V. L., Fadeev, V. V. and Tiskova, A. G. Moscove, Nanc — Ibled. Inst. Aeroklim, T. Vyp.77 (1971) pp.52–55 (refs in Russian)

📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 118 KB