✦ LIBER ✦

Approximation complexity of Metric Dimension problem

✍ Scribed by Mathias Hauptmann; Richard Schmied; Claus Viehmann

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational complexity of the graph ap

✍ A. A. Ageev; V. P. Il’ev; A. V. Kononov; A. S. Talevnin 📂 Article 📅 2007 🏛 Pleiades Publishing 🌐 English ⚖ 530 KB

Variable neighborhood search for the str

✍ Nenad Mladenović; Jozef Kratica; Vera Kovačević-Vujčić; Mirjana Čangalović 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Complexity and approximation of an area

✍ C. A. J. Hurkens; A. Lodi; S. Martello; M. Monaci; G. J. Woeginger 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 142 KB

Complexity and approximation of the Cons

✍ Cristina Bazgan; Basile Couëtoux; Zsolt Tuza 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Dependence on the Dimension for Complexi

✍ Serdyukova, Nora A. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 199 KB

Two problems in metric diophantine appro

✍ Paul A. Catlin 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 314 KB