Skip to main content
SpringerLink
Log in

Randomized Adaptive Test Cover

  • Conference paper
  • First Online:
Book cover Algorithms and Complexity (CIAC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9079))

Included in the following conference series:

  • 808 Accesses

Abstract

In a general combinatorial search problem with binary tests we are given a set of elements and a hypergraph of possible tests, and the goal is to find an unknown target element using a minimum number of tests. We explore the expected test number of randomized strategies. We obtain several general results on the ratio of the expected and worst-case deterministic test number, as well as complexity results for hypergraphs of small rank, and we state some open problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Basavaraju, M., Francis, M.C., Ramanujan, M.S., Saurabh, S.: Partially Polynomial Kernels for Set Cover and Test Cover. In: Seth, A., Vishnoi, N.K. (Eds.) FSTTCS 2013. LIPIcs, vol. 24, pp. 67–78. Dagstuhl (2013)

    Google Scholar 

  2. de Bontridder, K.M.J., Halldórsson, B.V., Halldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation Algorithms for the Test Cover Problem. Math. Progr. Series B 98, 477–491 (2003)

    Article  MATH  Google Scholar 

  3. De Bontridder, K.M.J., Lageweg, B.J., Lenstra, J.K., Orlin, J.B., Stougie, L.: Branch-and-bound algorithms for the test cover problem. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 223–233. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Crowston, R., Gutin, G., Jones, M., Muciaccia, G., Yeo, A.: Parameterizations of Test Cover with Bounded Test Sizes. CoRR abs/1209.6528 (2012)

    Google Scholar 

  5. Crowston, R., Gutin, G., Jones, M., Saurabh, S., Yeo, A.: Parameterized study of the test cover problem. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 283–295. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Cui, P.: A tighter analysis of set cover greedy algorithm for test set. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 24–35. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. Series on Appl. Math. vol. 3. World Scientific (2000)

    Google Scholar 

  8. Fahle, T., Tiemann, K.: A Faster Branch-and-Bound Algorithm for the Test-Cover Problem Based on Set-Covering Techniques. ACM J. Experim. Algor. 11 (2006)

    Google Scholar 

  9. Fernau, H., Raible, D.: A parameterized perspective on packing paths of length two. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 54–63. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Gutin, G., Muciaccia, G., Yeo, A.: (Non-)existence of Polynomial Kernels for the Test Cover Problem. Info. Proc. Letters 113, 123–126 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hochbaum, D.S.: Solving Integer Programs over Monotone Inequalities in Three Variables: A Framework for Half Integrality and Good Approximations. Eur. J. Operational Res. 140, 291–321 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Wiener, G.: Rounds in Combinatorial Search. Algorithmica 67, 315–323 (2013)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Chalmers University, 41296, Göteborg, Sweden

    Peter Damaschke

Authors
  1. Peter Damaschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Damaschke .

Editor information

Editors and Affiliations

  1. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    Vangelis Th. Paschos

  2. Inst. of Theoretical Computer Science, ETH Zürich, Zürich, Switzerland

    Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Damaschke, P. (2015). Randomized Adaptive Test Cover. In: Paschos, V., Widmayer, P. (eds) Algorithms and Complexity. CIAC 2015. Lecture Notes in Computer Science(), vol 9079. Springer, Cham. https://doi.org/10.1007/978-3-319-18173-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18173-8_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18172-1

  • Online ISBN: 978-3-319-18173-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation