✦ LIBER ✦

Two algorithms for approximate construction of the set of positional absorption in the game problem of pursuit

✍ Scribed by D. K. Mikhalev; V. N. Ushakov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The construction of ε-approximate algori

✍ M.Ya. Kovalev; Ya.M. Shafranskii 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 836 KB

A worst-case analysis of two approximate

✍ Giovanni Righini; Marco Trubian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Approximation algorithms for the bid con

✍ Jiongjiong Song; Amelia Regan 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Some algorithms for finding the approxim

✍ A.V. Goncharskii; L.G. Gushchina; A.S. Leonov; A.G. Yagola 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 877 KB

A({{10}})-Approximation Algorithm for a

✍ Robert Carr; Toshihiro Fujito; Goran Konjevod; Ojas Parekh 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 85 KB

Algorithms for the solution of the two-s

✍ N. Z. Shor; M. B. Shchepakin 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 190 KB