Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization pp 377–412Cite as

NP-Completeness

  • Chapter
  • First Online:

  • 7694 Accesses

Part of the book series: Algorithms and Combinatorics ((AC,volume 21))

Abstract

For many combinatorial optimization problems a polynomial-time algorithm is known; the most important ones are presented in this book. However, there are also many important problems for which no polynomial-time algorithm is known. Although we cannot prove that none exists we can show that a polynomialtime algorithm for one “hard” (more precisely: NP-hard) problem would imply a polynomial-time algorithm for almost all problems discussed in this book (more precisely: all NP-easy problems).

This is a preview of subscription content, 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   69.99
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aho, A.V., Hopcroft, J.E., and Ullman, J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading 1974

    MATH  Google Scholar 

  • Arora, S., and Barak, B. [2009]: Computational Complexity: A Modern Approach. Cambridge University Press, New York 2009

    MATH  Google Scholar 

  • Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M. [1999]: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin 1999

    MATH  Google Scholar 

  • Bovet, D.B., and Crescenzi, P. [1994]: Introduction to the Theory of Complexity. Prentice-Hall, New York 1994

    Google Scholar 

  • Garey, M.R., and Johnson, D.S. [1979]: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco 1979, Chapters 1–3, 5, and 7

    Google Scholar 

  • Goldreich, O. [2008]: Computational Complexity: A Conceptual Perspective. Cambrige University Press, New York 2008

    MATH  Google Scholar 

  • Horowitz, E., and Sahni, S. [1978]: Fundamentals of Computer Algorithms. Computer Science Press, Potomac 1978, Chapter 11

    Google Scholar 

  • Johnson, D.S. [1981]: The NP-completeness column: an ongoing guide. Journal of Algorithms starting with Vol. 4 (1981)

    Google Scholar 

  • Karp, R.M. [1975]: On the complexity of combinatorial problems. Networks 5 (1975), 45–68

    MATH  MathSciNet  Google Scholar 

  • Papadimitriou, C.H. [1994]: Computational Complexity. Addison-Wesley, Reading 1994

    MATH  Google Scholar 

  • Papadimitriou, C.H., and Steiglitz, K. [1982]: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Chapters 15 and 16

    Google Scholar 

  • Wegener, I. [2005]: Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer, Berlin 2005

    MATH  Google Scholar 

  • Adleman, L.M., Pomerance, C., and Rumely, R.S. [1983]: On distinguishing prime numbers from composite numbers. Annals of Mathematics 117 (1983), 173–206

    Article  MATH  MathSciNet  Google Scholar 

  • Agrawal, M., Kayal, N., and Saxena, N. [2004]: PRIMES is in P. Annals of Mathematics 160 (2004), 781–793

    Article  MATH  MathSciNet  Google Scholar 

  • Cook, S.A. [1971]: The complexity of theorem proving procedures. Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971), 151–158

    Google Scholar 

  • Edmonds, J. [1965]: Minimum partition of a matroid into independent subsets. Journal of Research of the National Bureau of Standards B 69 (1965), 67–72

    MATH  MathSciNet  Google Scholar 

  • van Emde Boas, P. [1990]: Machine models and simulations. In: Handbook of Theoretical Computer Science; Volume A; Algorithms and Complexity (J. van Leeuwen, ed.), Elsevier, Amsterdam 1990, pp. 1–66

    Google Scholar 

  • Fürer, M. [2009]: Faster integer multiplication. SIAM Journal on Computing 39 (2009), 979–1005

    Article  MATH  MathSciNet  Google Scholar 

  • Garey, M.R., Johnson, D.S., and Stockmeyer, L. [1976]: Some simplified NP-complete graph problems. Theoretical Computer Science 1 (1976), 237–267

    Article  MATH  MathSciNet  Google Scholar 

  • Hopcroft, J.E., and Ullman, J.D. [1979]: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading 1979

    MATH  Google Scholar 

  • Karp, R.M. [1972]: Reducibility among combinatorial problems. In: Complexity of Computer Computations (R.E. Miller, J.W. Thatcher, eds.), Plenum Press, New York 1972, pp. 85–103

    Google Scholar 

  • Ladner, R.E. [1975]: On the structure of polynomial time reducibility. Journal of the ACM 22 (1975), 155–171

    Article  MATH  MathSciNet  Google Scholar 

  • Lewis, H.R., and Papadimitriou, C.H. [1981]: Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs 1981

    MATH  Google Scholar 

  • Orlin, J.B., Punnen, A.P., and Schulz, A.S. [2009]: Integer programming: optimization and evaluation are equivalent. In: Algorithms and Data Structures – Proceedings of the 11th Algorithms and Data Structures Symposium; LNCS 5664 (F. Dehne, M. Gavrilova, J.-R. Sack, C.D. Tóth, eds.), Springer, Berlin 2009, pp. 519–529

    Google Scholar 

  • Papadimitriou, C.H., and Yannakakis, M. [1990]: On recognizing integer polyhedra. Combinatorica 10 (1990), 107–109

    Article  MATH  MathSciNet  Google Scholar 

  • Pratt, V. [1975]: Every prime has a succinct certificate. SIAM Journal on Computing 4 (1975), 214–220

    Article  MATH  MathSciNet  Google Scholar 

  • Schönhage, A., and Strassen, V. [1971]: Schnelle Multiplikation großer Zahlen. Computing 7 (1971), 281–292

    Article  MATH  Google Scholar 

  • Schulz, A.S. [2009]: On the relative complexity of 15 problems related to 0/1-integer programming. In: Research Trends in Combinatorial Optimization (W.J. Cook, L. Lovász, J. Vygen, eds.), Springer, Berlin 2009, pp. 399–428

    Google Scholar 

  • Turing, A.M. [1936]: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (2) 42 (1936), 230–265 and 43 (1937), 544–546

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, 53113, Bonn, Germany

    Bernhard Korte & Jens Vygen

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernhard Korte .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Korte, B., Vygen, J. (2012). NP-Completeness. In: Combinatorial Optimization. Algorithms and Combinatorics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24488-9_15

Download citation

Publish with us

Policies and ethics

Search

Navigation