An Exact Algorithm for Steiner Tree Problem on Graphs | Zendy

Milan Stanojević | Zendy; Mirko Vujošević | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Exact Algorithm for Steiner Tree Problem on Graphs

Author(s) -

Milan Stanojević,

Mirko Vujošević

Publication year - 2006

Publication title -

international journal of computers communications and control

Language(s) - English

Resource type - Journals

eISSN - 1841-9844

pISSN - 1841-9836

DOI - 10.15837/ijccc.2006.1.2271

Subject(s) - steiner tree problem , computer science , gomory–hu tree , simple (philosophy) , integer programming , algorithm , graph , node (physics) , linear programming , mathematics , theoretical computer science , mathematical optimization , k ary tree , tree structure , binary tree , philosophy , structural engineering , epistemology , engineering

c Abstract: The paper presents a new original algorithm for solving Steiner tree problem on graph. The algorithm is simple and intended for solving problems with relatively low dimensions. It is based on use of existing open source software for solving integer linear pro- gramming problems. The algorithm is tested and shown very efficient for different randomly generated problems on graphs of up to 50 nodes, up to 10 terminals and average node degree 7.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research