Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1979: Mathematical Foundations of Computer Science 1979 pp 292–300Cite as

Computational complexity of approximation algorithms for combinatorial problems

  • Communications
  • Conference paper
  • First Online:

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

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. Babat, L.G., Linear function on the N-dimensional unit cube. Dokl. Akad. Nauk SSSR, 222 (1975), 761–762.

    Google Scholar 

  2. Babat, L.G., A fixed-charge problem. Izv. Akad. Nauk SSSR, Engeneering Cybernetics, 3, (1978), 25–31.

    Google Scholar 

  3. Cornuejols G., Fisher M.L., Nemhauser G.L., Location of bank accounts to optimize floats. Manag.Sci., 23 (1977), 789–810.

    Google Scholar 

  4. Gens G.V., Levner E.V. Approximate algorithms for NP-hard scheduling problems. Izv. Akad. Nauk SSSR, Engineering Cybernetics 6, (1978), 38–43.

    Google Scholar 

  5. Ibarra O.H., Kim C.E., Fast approximation algorithms for the knapsack and sum of subset problems. J.ACM, 22 (1975), 463–468.

    Article  Google Scholar 

  6. Karp R.M., The probabilistic analysis of some combinatorial search algorithms. In: Algorithms and Complexity (ed. Traub J.F.), (1976) 1–19.

    Google Scholar 

  7. Lawler E.L., Fast approximation algorithms for knapsack problems. In: Interfaces between Computer Science and Operations Research, Amsterdam, Mathematical Centre Tracts, 99, (1978).

    Google Scholar 

  8. Levner E.V., Gens G.V. Discrete Optimization Problems and Efficient Approximation Algorithms. Moscow, Central Economic and Mathematical Institute, USSR Academy of Sciences, (1978) (in Russian).

    Google Scholar 

  9. Sahni S. Algorithms for scheduling independent tasks. J.ACM, 23 (1976), 114–127.

    Google Scholar 

  10. Sahni S., Gonzales T. P-complete approximation problems. J.ACM, 23 (1976), 555–565.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Central Economic and Mathematical Institute, USSR Academy of Sciences, 117333, Moscow

    G. V. Gens & E. V. Levner

Authors
  1. G. V. Gens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. V. Levner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gens, G.V., Levner, E.V. (1979). Computational complexity of approximation algorithms for combinatorial problems. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation