✦ LIBER ✦

Complexity and approximation of the Constrained Forest problem

✍ Scribed by Cristina Bazgan; Basile Couëtoux; Zsolt Tuza

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

Approximation complexity of Metric Dimen

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

Complexity and approximation of the conn

✍ Wei Zhang, Weili Wu, Wonjun Lee, Ding-Zhu Du 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 246 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

On the constrained Chebyshev approximati

✍ Bernd Fischer; Roland Freund 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 672 KB

Approximation Algorithms for the Interva

✍ Ernst Althaus; Stefan Canzar; Khaled Elbassioni; Andreas Karrenbauer; Julián Mes 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 791 KB