IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4614-1701-9_10.html
   My bibliography  Save this book chapter

Inapproximability

In: Design and Analysis of Approximation Algorithms

Author

Listed:
  • Ding-Zhu Du

    (University of Texas at Dallas)

  • Ker-I Ko

    (State University of New York at Stony Brook)

  • Xiaodong Hu

    (Academy of Mathematics and Systems Science Chinese Academy of Sciences)

Abstract

In this chapter, we turn our attention to a different issue about approximation algorithms. We study how to prove inapproximability results for some NP-hard optimization problems. We are not looking here for a lower bound for the performance ratio of a specific approximation algorithm, but, instead, we try to find a lower bound for the performance ratio of any approximation algorithmfor a given problem.Most results in this study are based on advanced developments in computational complexity theory, which is beyond the scope of this book. Therefore, we limit ourselves to fundamental concepts and results, often with proofs omitted, which are sufficient to establish the inapproximability of many combinatorial optimization problems.

Suggested Citation

  • Ding-Zhu Du & Ker-I Ko & Xiaodong Hu, 2012. "Inapproximability," Springer Optimization and Its Applications, in: Design and Analysis of Approximation Algorithms, chapter 10, pages 371-406, Springer.
    • Handle: RePEc:spr:spochp:978-1-4614-1701-9_10
    DOI: 10.1007/978-1-4614-1701-9_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-1-4614-1701-9_10. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.