✦ LIBER ✦

Computational complexity of the graph approximation problem

✍ Scribed by A. A. Ageev; V. P. Il’ev; A. V. Kononov; A. S. Talevnin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the computational complexity of graph

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the Computational Complexity of Best

✍ Paulo Oliva 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 3 views

Unique optimal solution instance and com

✍ He Jiang; XianChao Zhang; GuoLiang Chen 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 507 KB

Approximation complexity of Metric Dimen

✍ Mathias Hauptmann; Richard Schmied; Claus Viehmann 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 261 KB

The computational complexity of graph pr

✍ M. Karpinski; K. W. Wagner 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 451 KB

Computational complexity of some interfe

✍ Gamst, A.; Ralf, K. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 732 KB