Neural network for optimal steiner tree computation

Chotipat Pornavalai, Norio Shiratori, Goutam Chakraborty

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    Hopfield neural network model for finding the shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to a more general problem of searching an optimal tree (least total cost tree) from a source node to a number of destination nodes in a graph. This problem is called Steiner tree in graph theory, where it is proved to be a NP-complete. Through computer simulations, it is shown that the proposed model could always find an optimal or near-optimal valid solution in various graphs.

    Original languageEnglish
    Pages (from-to)139-149
    Number of pages11
    JournalNeural Processing Letters
    Volume3
    Issue number3
    Publication statusPublished - 1996

    Fingerprint

    Neural Networks (Computer)
    Computer Simulation
    Neural networks
    Costs and Cost Analysis
    Hopfield neural networks
    Graph theory
    Computer simulation
    Costs

    Keywords

    • Hopfield model
    • Neural networks
    • Optimization
    • Steiner tree

    ASJC Scopus subject areas

    • Artificial Intelligence
    • Neuroscience(all)

    Cite this

    Pornavalai, C., Shiratori, N., & Chakraborty, G. (1996). Neural network for optimal steiner tree computation. Neural Processing Letters, 3(3), 139-149.

    Neural network for optimal steiner tree computation. / Pornavalai, Chotipat; Shiratori, Norio; Chakraborty, Goutam.

    In: Neural Processing Letters, Vol. 3, No. 3, 1996, p. 139-149.

    Research output: Contribution to journalArticle

    Pornavalai, C, Shiratori, N & Chakraborty, G 1996, 'Neural network for optimal steiner tree computation', Neural Processing Letters, vol. 3, no. 3, pp. 139-149.
    Pornavalai C, Shiratori N, Chakraborty G. Neural network for optimal steiner tree computation. Neural Processing Letters. 1996;3(3):139-149.
    Pornavalai, Chotipat ; Shiratori, Norio ; Chakraborty, Goutam. / Neural network for optimal steiner tree computation. In: Neural Processing Letters. 1996 ; Vol. 3, No. 3. pp. 139-149.
    @article{347834e7cd724d86be183033266bf1c2,
    title = "Neural network for optimal steiner tree computation",
    abstract = "Hopfield neural network model for finding the shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to a more general problem of searching an optimal tree (least total cost tree) from a source node to a number of destination nodes in a graph. This problem is called Steiner tree in graph theory, where it is proved to be a NP-complete. Through computer simulations, it is shown that the proposed model could always find an optimal or near-optimal valid solution in various graphs.",
    keywords = "Hopfield model, Neural networks, Optimization, Steiner tree",
    author = "Chotipat Pornavalai and Norio Shiratori and Goutam Chakraborty",
    year = "1996",
    language = "English",
    volume = "3",
    pages = "139--149",
    journal = "Neural Processing Letters",
    issn = "1370-4621",
    publisher = "Springer Netherlands",
    number = "3",

    }

    TY - JOUR

    T1 - Neural network for optimal steiner tree computation

    AU - Pornavalai, Chotipat

    AU - Shiratori, Norio

    AU - Chakraborty, Goutam

    PY - 1996

    Y1 - 1996

    N2 - Hopfield neural network model for finding the shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to a more general problem of searching an optimal tree (least total cost tree) from a source node to a number of destination nodes in a graph. This problem is called Steiner tree in graph theory, where it is proved to be a NP-complete. Through computer simulations, it is shown that the proposed model could always find an optimal or near-optimal valid solution in various graphs.

    AB - Hopfield neural network model for finding the shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to a more general problem of searching an optimal tree (least total cost tree) from a source node to a number of destination nodes in a graph. This problem is called Steiner tree in graph theory, where it is proved to be a NP-complete. Through computer simulations, it is shown that the proposed model could always find an optimal or near-optimal valid solution in various graphs.

    KW - Hopfield model

    KW - Neural networks

    KW - Optimization

    KW - Steiner tree

    UR - http://www.scopus.com/inward/record.url?scp=0030206324&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0030206324&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:0030206324

    VL - 3

    SP - 139

    EP - 149

    JO - Neural Processing Letters

    JF - Neural Processing Letters

    SN - 1370-4621

    IS - 3

    ER -