Abstract
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, if A ∩ B = {z}, then element z∈ A is selected by set B. Selectors are such families \(\mathcal{S}\) of sets B of some domain that allow to select many elements from sufficiently small subsets A of the domain. Selectors are used in communication protocols for the multiple-access channel, in implementations of distributed-computing primitives in radio networks, and in algorithms for group testing. We give new explicit (n,k,r)-selectors of size \(\mathcal{O}(min [n, \frac{k^2}{k-r+1} polylog~n])\), for any parameters r ≤ k ≤ n. We establish a lower bound \(\Omega(min [n, \frac{k^2}{k-r+1} \cdot \frac{log(n/k)}{log(k/(k-r+1))}])\) on the length of (n,k,r)-selectors, which demonstrates that our construction is within a polylog n factor close to optimal. The new selectors are applied to develop explicit implementations of selection resolution on the multiple-access channel, gossiping in radio networks and an algorithm for group testing with inhibitors.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. Journal of Computer and System Sciences 45, 104–126 (1992)
Chaudhuri, S., Radhakrishnan, J.: Deterministic restrictions in circuit complexity. In: Proc., 28th ACM Symposium on Theory of Computing (STOC), pp. 30–36 (1996)
Chlebus, B.S.: Randomized communication in radio networks. In: Pardalos, P.M., Rajasekaran, S., Reif, J., Rolim, J.D.P. (eds.) Handbook of Randomized Computing, vol. I, pp. 401–456. Kluwer Academic Publishers, Dordrecht (2001)
Chlebus, B.S., Gąsieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing 15, 27–38 (2002)
Chlebus, B.S., Kowalski, D.R.: A better wake-up in radio networks. In: Proc., 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 266–274 (2004)
Chrobak, M., Gąsieniec, L., Kowalski, D.R.: The wake-up problem in multihop radio networks. In: Proc.,15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 985–993 (2004)
Chrobak, M., Gąsieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal of Algorithms 43, 177–189 (2002)
Chu, W., Colbourn, C.J., Syrotiuk, V.R.: Slot synchronized topology-transparent scheduling for sensor networks, Computer Communications (to appear)
Chu, W., Colbourn, C.J., Syrotiuk, V.R.: Topology transparent scheduling, synchronization, and maximum delay. In: Proc.,18th International Parallel and Distributed Processing Symposium (IPDPS), pp. 223–228 (2004)
Clementi, A.E.F., Crescenzi, P., Monti, A., Penna, P., Silvestri, R.: On computing ad-hoc selective families. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 211–222. Springer, Heidelberg (2001)
Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theoretical Computer Science 302, 337–364 (2003)
Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc., 44th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 492–501 (2003)
De Bonis, A., Gąsieniec, L., Vaccaro, U.: Generalized framework for selectors with applications in optimal group testing. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 81–96. Springer, Heidelberg (2003)
De Bonis, A., Vaccaro, U.: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theoretical Computer Science 306, 223–243 (2003)
De Bonis, A., Vaccaro, U.: Improved algorithms for group testing with inhibitors. Information Processing Letters 67, 57–64 (1998)
Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications. World Scientific, Singapore (2000)
Dyachkov, A.G., Rykov, V.V.: A survey of superimposed code theory. Problems of Control and Information Theory 12, 229–244 (1983)
Dyachkov, A.G., Rykov, V.V.: Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii 18, 7–13 (1982)
Füredi, Z.: On r-cover free families. Journal of Combinatorial Theory (A) 73, 172–173 (1996)
Gąsieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM Journal on Discrete Mathematics 14, 207–222 (2001)
Ga̧sieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad-hoc radio networks. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 397–407. Springer, Heidelberg (2004)
Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc., 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 697–704 (2002)
Jukna, S.: Extremal Combinatorics. Springer, Heidelberg (2001)
Kautz, W.H., Singleton, R.R.C.: Nonrandom binary superimposed codes. IEEE Transactions on Information Theory 10, 363–377 (1964)
Komlós, J., Greenberg, A.G.: An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Transactions on Information Theory 31, 303–306 (1985)
Kowalski, D.R., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM Journal on Computing 33, 870–891 (2004)
Kushilevitz, E., Mansour, Y.: An Ω(Dlog(N/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing 27, 702–712 (1998)
Ta-Shma, A., Umans, C., Zuckerman, D.: Loss-less condensers, unbalanced expanders, and extractors. In: Proc., 33rd ACM Symposium on Theory of Computing (STOC), pp. 143–152 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chlebus, B.S., Kowalski, D.R. (2005). Almost Optimal Explicit Selectors. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_24
Download citation
DOI: https://doi.org/10.1007/11537311_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28193-1
Online ISBN: 978-3-540-31873-6
eBook Packages: Computer ScienceComputer Science (R0)