Skip to main content
SpringerLink
Log in
SpringerLink
Log in

On Construction of the Set of Irreducible Partial Covers

  • Conference paper
Stochastic Algorithms: Foundations and Applications (SAGA 2005)

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

Included in the following conference series:

  • 735 Accesses

Abstract

In the paper a totally polynomial algorithm for construction of the set of irreducible partial covers for the major part of set cover problems is considered.

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. Boros, E., Hammer, P.L., Ibaraki, T., Kawakami, K.: Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle. SIAM J. Computing 26(1), 93–109 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chegis, I.A., Yablonskii, S.V.: Logical methods of electric circuit control. Trudy MIAN SSSR 51, 270–360 (1958) (in Russian)

    Google Scholar 

  3. Korshunov, A.D.: On the number of monotone Boolean functions. Problemy Kibernetiki 38, 5–108 (1981) (in Russian)

    Google Scholar 

  4. Makino, K., Ibaraki, T.: The maximum latency and identification of positive Boolean functions. SIAM J. Computing 26(5), 1363–1383 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  6. Shmulevich, I., Korshunov, A.D., Astola, J.: Almost all monotone Boolean functions are polynomially lernable using membership queries. Information Processing Letters 79, 211–213 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Skowron, A.: Rough sets in KDD. In: Proceedings of the 16-th World Computer Congress (IFIP 2000). Beijing, China, pp. 1–14 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Foundation for Support of Agrarian Reform and Rural Development, 21-1, B. Kharitonyevsky, Moscow, 105064, Russia

    Mikhail Ju. Moshkov

  2. Institute of Computer Science, University of Silesia, 39, B̧edzińska St., Sosnowiec, 41-200, Poland

    Mikhail Ju. Moshkov

Authors
  1. Mikhail Ju. Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Discrete Mathematics, Leninskie Gory, Moscow State University, 119992, Moscow, Russia

    Oleg B. Lupanov  & Oktay M. Kasim-Zade  & 

  2. Faculty of Mechanics and Mathematics, Department of Discrete Mathematics, Leninskie Gory, Moscow State University, 119992, Moscow, Russia

    Alexander V. Chaskin

  3. Department of Computer Science, King’s College London, WC2R 2LS, London, UK

    Kathleen Steinhöfel

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moshkov, M.J. (2005). On Construction of the Set of Irreducible Partial Covers. In: Lupanov, O.B., Kasim-Zade, O.M., Chaskin, A.V., Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2005. Lecture Notes in Computer Science, vol 3777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11571155_4

Download citation

  • DOI: https://doi.org/10.1007/11571155_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29498-6

  • Online ISBN: 978-3-540-32245-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation