✦ LIBER ✦

On the complexity of non-unique probe selection

✍ Scribed by Yongxi Cheng; Ker-I Ko; Weili Wu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity and approximation of n

✍ My T. Thai; Taieb Znati 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 292 KB

Non-unique probe selection and group tes

✍ Feng Wang; Hongwei David Du; Xiaohua Jia; Ping Deng; Weili Wu; David MacCallum 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 207 KB

A New Approach to the Non-unique Probe S

✍ Cláudio N. Meneses; Panos M. Pardalos; Michelle A. Ragle 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 286 KB

Selection based heuristics for the non-u

✍ Alioune Ngom; Luis Rueda; Lili Wang; Robin Gras 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 703 KB

An Optimal Cutting-Plane Algorithm for S

✍ Michelle A. Ragle; J. Cole Smith; Panos M. Pardalos 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 268 KB

On the expected complexity of distribute

✍ Nicola Santoro; Michael Scheutzow; Jeffrey B. Sidney 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 562 KB