✦ LIBER ✦

Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center

✍ Scribed by V. V. Shenmaier

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the complexity of an algorithm

✍ A. A. Goldstein 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 361 KB

On the Convergence of a Hyperboloid Appr

✍ J. B. Rosen and G. L. Xue 📂 Article 📅 1993 🏛 INFORMS 🌐 English ⚖ 327 KB

On the Complexity of the Elzinga-Hearn A

✍ Zvi Drezner and Saharon Shelah 📂 Article 📅 1987 🏛 INFORMS 🌐 English ⚖ 275 KB

The computational complexity and approxi

✍ Khachai, M. Yu.; Poberii, M. I. 📂 Article 📅 2013 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 482 KB

Approximation for the Location of the Ce

✍ M. L. Glasser and J. Koplowitz 📂 Article 📅 1991 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 169 KB

On the computational complexity of the m

✍ Maciej M. Syslo 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 454 KB