Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computing and Information

ICCI 1990: Advances in Computing and Information — ICCI '90 pp 24–33Cite as

On the formal aspects of approximation algorithms

  • Theory Of Computing, Algorithms And Programming
  • Conference paper
  • First Online:

  • 144 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 468))

Abstract

Formal aspects of approximated solutions to difficult problems are considered. We define an approximation machine and its language as a formal model of computation. We strengthen previous results by showing the interpretation of the complexity classes with density in terms of approximation languages. In particular, we analyze the worst-case, the best-case and the average-case complexity related to the formal languages of approximation machines. The relationship between density of a complexity class and the “goodness” of an approximation is also investigated.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Ben-David, B. Chor, O. Goldreich, and M. Luby. Towards a theory of average case complexity. In Proceedings 21th Annual ACM Symposium on Theory of Computing, Seatle, Washington, 1989.

    Google Scholar 

  2. A. Goldberg, P. Purdom, and C. Brown. Average time analysis of simplified davis-putnan procedures. Information Processing Letters, 15:72–75, 1982.

    Google Scholar 

  3. A. V. Goldberg and A. Marchetti-Spaccamela. On finding the exact solution of a zero-one knapsack problem. In Proceedings 16th Annual ACM Symposium on Theory of Computing, New York, 1984.

    Google Scholar 

  4. J. Hartmanis. On sparse sets in NP-P. Information Processing Letters, 16:55–60, 1983.

    Google Scholar 

  5. D. S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, (5):284–299, 1984.

    Google Scholar 

  6. K. Ko and D. More. Completeness, approximation and density. SIAM Journal of Computing, 10:787–796, 1981.

    Google Scholar 

  7. J. C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. In Proceedings 24th Annual Symposium on Foundations of Computer Science, Los Angeles, 1983.

    Google Scholar 

  8. L. A. Levin. Problems complete in average instance. In Proceedings 16th Annual ACM Symposium on Theory of Computing, 1984.

    Google Scholar 

  9. N. A. Lynch. Approximations to the halting problem. J. Comput. Syst. Science, 9:143–150, 1974.

    Google Scholar 

  10. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. In Proceedings 20th Annual ACM Symposium on Theory of Computing, pages 229–234, 1988.

    Google Scholar 

  11. A. Paz and S. Moran. Non deterministic polynomial optimization problems and their approximation. Theoretical Computer Science, 15:251–277, 1981.

    Google Scholar 

  12. J. Rolim. Towards a complexity theory for approximation languages. paper presented at the 3rd. Symposium on Complexity of Approximately Solved Problems at Columbia University, New York, April 1989.

    Google Scholar 

  13. J. Rolim and S. Greibach. On the IO-complexity and approximation languages. Information Processing Letters, 28(1):27–31, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Odense University, Campusvej 55, 5230 M, Odense, Denmark

    José D. P. Rolim

Authors
  1. José D. P. Rolim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rolim, J.D.P. (1991). On the formal aspects of approximation algorithms. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53504-1

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation