Skip to main content
SpringerLink
Log in

Approximation Algorithm for the Argument Reduction Problem

  • Conference paper
Computer Recognition Systems

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

Abstract

This paper proposes a new method of solving the argument reduction problem. Our method is different to the classical approach using the greedy algorithm, independently invented by Lovasz, Johnson, and Chvatal. However, sometimes the classical method does not produce minimal sets in the sense of cardinality. According to the results of computer tests, better results can be achieved by application of our method in combination with the classical method. Therefore, improvements are found in the quality of solutions when it is applied as a post-processing method.

Research partly supported by the grant from the State Committee for Scientific Research. Decision no. 55/E-82/SPB/5.PR UE/DZ 385/2003–2005 of 16.07.2003

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Aussiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M, (1999) “Complexity and Approximation”, Springer

    Google Scholar 

  2. Ballobas B (1986) “Combinatorics, Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability”, Cambridge University Press

    Google Scholar 

  3. Berge C (1989) “Hypergraphs, Combinatorics of Finite Sets”, North-Holland

    Google Scholar 

  4. Berger B, Rompel J (1994) “Effcient NC Algorithms for Set Cover with Applications to Learning and Geometry”, Journal of Computer and System Sciences 49, 454–477

    Google Scholar 

  5. Blot J, Hemandez de la Vega W, Paschos V Th, Saad R (1995) “Average case analysis of greedy algorithms for optimisation problems on set problems”, Theoretical Computer Science 147, 267–288

    Article  MATH  MathSciNet  Google Scholar 

  6. Buciak P, Ċuba T, Niewiadomski H, Pleban M, Sapiecha P, Selvaraj H (2002): Decomposition and Argument Reduction of Neural Networks, IEEE Sixth International Conference on Neural Networks and Soft Computing (ICNNSC’02), Poland, June 11–15, 2002

    Google Scholar 

  7. Chvatal V (1979) “A greedy heuristic for the set-covering problem”, Mathematics and Operations Research, 4, 233–235

    Article  MATH  MathSciNet  Google Scholar 

  8. Feige U (1998), “A Threshold of ln(n) for Approximating Set Cover”, Journal of the ACM

    Google Scholar 

  9. Hromkovic J (2001) “Algorithmics for Hard Problems”, Springer

    Google Scholar 

  10. Hochbaum D S (Ed.) (1997) Approximation Algorithms for NP-hard Problems, PWS Publishing Company

    Google Scholar 

  11. Korte B, Vygen J (2000) “Combinatorial Optimization, Theory and Algorithms”, Springer

    Google Scholar 

  12. Johnson D S (1974) “Approximation Algorithms for Combinatorial Problems”, Journal of Computer and System Sciences, 9, 256–278

    Article  MATH  MathSciNet  Google Scholar 

  13. Lovasz L (1975) “On the ratio of optimal integral and fractional covers”, Discrete Mathematics 13 383–390

    Article  MATH  MathSciNet  Google Scholar 

  14. Lund C, Yannakakis M (1994) “On the Hardness of Approximating Minimization Problems”, Journal of the ACM

    Google Scholar 

  15. de Micheli G (1994) “Synthesis and Optimization of Digital Circuits”, McGraw-Hill Inc.

    Google Scholar 

  16. Motvani R (1992) “Lecture Notes on Approximation Algorithms-Volume F”, Stanford University

    Google Scholar 

  17. Niewiadomski H, Buciak P, Pleban M, Selvaraj H, Sapiecha P, Ċuba T (2002) Decomposition of Large Neural Networks, Proceedings of the IASTED International Conference, Applied Informatics, International Symposium on Artificial Intelligence and Applications, pp. 165–170, Insbruck, Austria, February 18–21, 2002

    Google Scholar 

  18. Pleban M, Niewiadomski H, Buciak P, Sapiecha P, Yanushkevich S, Shmerko V (2002) Argument reduction algorithms for multi-valued relations, IASTED International Conference on Artificial Intelligence and Soft Computing (ASC 2002), pp. 609–614, Banff, Canada, July 17–19, 2002

    Google Scholar 

  19. Skowron A, Rauszer C (1992) “The discemibility matrices and functions in information systems”, in: R. Slowinski (Ed.), “Intelligent Decision Support. Handbook of Applications and Advances on the Rough Set Theory”, Kluwer

    Google Scholar 

  20. Slavik P (1996) “A Tight Analysis of the Greedy Algorithm for Set Cover”, STOC’96, USA

    Google Scholar 

  21. Srinivasan A (1995) “Improved Approximation Guamatees for Packing and Covering Integer Programs”, DIMACS TR.

    Google Scholar 

  22. Vazirani V (1997), “Approximation Algorithms”, Lecture Notes 1997, Georgia Institute of Technology

    Google Scholar 

  23. Williamson D (1999) “Lecture Notes on Approximation Algorithms”, IBM Research Report, RC 21409,02/17/1999

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Warsaw School of Information Technology, Newelska 6, 01-447, Warsaw, Poland

    Piotr KuĊ‚aga

  2. Department of Electronics and Information Technology, Warsaw University of Technology, ul. Nowowiejska 15/19, 00-665, Warsaw, Poland

    Piotr Sapiecha

  3. System Research Institute, Newelska 6, 01-447, Warsaw, Poland

    Krzysztof S#x0119;p

Authors
  1. Piotr KuĊ‚aga
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Sapiecha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Krzysztof S#x0119;p
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Electronics, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370, Wroclaw, Poland

    Marek KurzyĊ„ski , Edward PuchaĊ‚a , MichaĊ‚ WoĊşniak  & Andrzej ĊĵoĊ‚nierek , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

Âİ 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

KuĊ‚aga, P., Sapiecha, P., S#x0119;p, K. (2005). Approximation Algorithm for the Argument Reduction Problem. In: KurzyĊ„ski, M., PuchaĊ‚a, E., WoĊşniak, M., ĊĵoĊ‚nierek, A. (eds) Computer Recognition Systems. Advances in Soft Computing, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32390-2_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-32390-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25054-8

  • Online ISBN: 978-3-540-32390-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation