Skip to main content
Springer Nature Link
Log in

On Greedy Algorithms with Weights for Construction of Partial Covers

  • Conference paper
Intelligent Information Processing and Web Mining

Part of the book series: Advances in Soft Computing ((AINSC,volume 35))

  • 610 Accesses

Abstract

In the paper a modification of greedy algorithm with weights for construction of partial covers is considered. Theoretical and experimental results relating to accuracy of this algorithm are discussed.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. 1. Cheriyan, J., Ravi, R. (1998) Lecture notes on approximation algorithms for network problems. http://www.math.uwaterloo.ca/~jcheriya/lecnotes.html

    Google Scholar 

  2. 2. Chvátal, V. (1979) A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233–235

    Article  MATH  MathSciNet  Google Scholar 

  3. 3. Kearns, M.J. (1990) The Computational Complexity of Machine Learning. MIT Press, Cambridge, Massachussetts

    Google Scholar 

  4. 4. Moshkov, M.Ju. (2003) Greedy algorithm for set cover in context of knowledge discovery problems. Proceedings of the International Workshop on Rough Sets in Knowledge Discovery and Soft Computing (ETAPS 2003 Satellite Event). Warsaw, Poland. Electronic Notes in Theoretical Computer Science 82(4)

    Google Scholar 

  5. 5. Moshkov, M.Ju. (2003) On greedy algorithm for partial cover construction. Proceedings of the 14-th International Workshop Design and Complexity of Control Systems. Nizhny Novgorod, Russia 57 (in Russian)

    Google Scholar 

  6. 6. Moshkov, M.Ju., Piliszczuk, M., Zielosko, B. (2005) On greedy algorithm for construction of partial covers. Proceedings of the 14-th International Conference Problems of Theoretical Cybernetics. Penza, Russia 103 (in Russian)

    Google Scholar 

  7. 7. Pawlak, Z. (1991) Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht Boston London

    MATH  Google Scholar 

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

    Google Scholar 

  9. 9. Slavík, P. (1998) Approximation algorithms for set cover and related problems. Ph.D. thesis. University of New York at Bu.alo

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Silesia, 39, Będzińska St., 41-200, Sosnowiec, Poland

    Mikhail Ju. Moshkov & Beata Zielosko

  2. ING Bank śląski S.A., 34, Sokolska St., 40-086, Katowice, Poland

    Marcin Piliszczuk

Authors
  1. Mikhail Ju. Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Piliszczuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Beata Zielosko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Polish Academy of Sciences, Institute of Computer Science, ul. Ordona 21, 01-237, Warszawa, Poland

    Mieczysław A. Kłopotek , Sławomir T. Wierzchoń  & Krzysztof Trojanowski ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this paper

Cite this paper

Moshkov, M.J., Piliszczuk, M., Zielosko, B. (2006). On Greedy Algorithms with Weights for Construction of Partial Covers. In: Kłopotek, M.A., Wierzchoń, S.T., Trojanowski, K. (eds) Intelligent Information Processing and Web Mining. Advances in Soft Computing, vol 35. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33521-8_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-33521-8_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33520-7

  • Online ISBN: 978-3-540-33521-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics