✦ LIBER ✦

Radiocoloring in planar graphs: Complexity and approximations

✍ Scribed by D.A. Fotakis; S.E. Nikoletseas; V.G. Papadopoulou; P.G. Spirakis

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity results for identifying codes

✍ David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 514 KB

The Complexity of Counting in Sparse, Re

✍ Vadhan, Salil P. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 326 KB

The Computational Complexity of Tutte In

✍ Vertigan, Dirk 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 276 KB

The complexity of the chromatic sum prob

✍ Michal Malafiejski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 12 KB

On the complexity of finding even pairs

✍ Rudini M. Sampaio; Cléudia L. Sales 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 271 KB

Primal-Dual Approximation Algorithms for

✍ Michel X. Goemans; David P. Williamson 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 289 KB