IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v32y2015i01ns0217595915400102.html
   My bibliography  Save this article

An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges

Author

Listed:
  • Yu Zhou

    (School of Science, Hangzhou Dianzi University, Hangzhou, Zhejiang, 310018, P. R. China)

  • Wei Ding

    (Zhejiang University of Water Resources and Electric Power, Hangzhou, Zhejiang 310018, P. R. China)

  • Guangming Wang

    (School of Science, Hangzhou Dianzi University, Hangzhou, Zhejiang, 310018, P. R. China)

  • Guangting Chen

    (Taizhou University, Linhai, Zhejiang, 317000, P. R. China)

Abstract

The sum-max 2-most reliable sources (Sum-Max 2-MRS) problem in a given unreliable network is referred to as finding a pair of nodes in the network from which the expected number of reachable nodes is maximized. This problem is #P-hard on general graphs and admits a cubic time algorithm on trees with unreliable edges. In this paper, we revisit the problem on trees and design an edge-turbulence algorithm with a quadratic time and quadratic spaces. Finally, we further develop an edge-turbulence based parallel algorithm with a lower time complexity.

Suggested Citation

  • Yu Zhou & Wei Ding & Guangming Wang & Guangting Chen, 2015. "An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(01), pages 1-17.
    • Handle: RePEc:wsi:apjorx:v:32:y:2015:i:01:n:s0217595915400102
    DOI: 10.1142/S0217595915400102
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595915400102
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595915400102?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wei Ding & Ke Qiu, 2018. "A quadratic time exact algorithm for continuous connected 2-facility location problem in trees," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1262-1298, November.

    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:wsi:apjorx:v:32:y:2015:i:01:n:s0217595915400102. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.