IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v9y2005i3d10.1007_s10878-005-1413-8.html
   My bibliography  Save this article

On the Hardness of Approximating the Min-Hack Problem

Author

Listed:
  • Ramkumar Chinchani

    (State University of New York at Buffalo)

  • Duc Ha

    (State University of New York at Buffalo)

  • Anusha Iyer

    (State University of New York at Buffalo)

  • Hung Q. Ngo

    (State University of New York at Buffalo)

  • Shambhu Upadhyaya

    (State University of New York at Buffalo)

Abstract

We show several hardness results for the Minimum Hacking problem, which roughly can be described as the problem of finding the best way to compromise a target node given a few initial compromised nodes in a network. We give several reductions to show that Minimum Hacking is not approximable to within $$2^{(\log n)^{1-\delta}}$$ where δ = 1− $$\frac{1}{{log}{log}}$$ c n, for any c

Suggested Citation

  • Ramkumar Chinchani & Duc Ha & Anusha Iyer & Hung Q. Ngo & Shambhu Upadhyaya, 2005. "On the Hardness of Approximating the Min-Hack Problem," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 295-311, May.
    • Handle: RePEc:spr:jcomop:v:9:y:2005:i:3:d:10.1007_s10878-005-1413-8
    DOI: 10.1007/s10878-005-1413-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-1413-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-005-1413-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:jcomop:v:9:y:2005:i:3:d:10.1007_s10878-005-1413-8. 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.