An Algorithm to Find the Constrained Steiner Tree in Halin Networks

被引：0
|
作者：
Lu, Yunting [1 ]
Li, Zhenjun [2 ]
Li, Min [3 ]
机构：
[1] Shenzhen Inst Informat Technol, Shenzhen 518029, Peoples R China
[2] South China Univ Technol, Guangzhou 510641, Peoples R China
[3] Shenzhen Univ, Shenzhen 518060, Peoples R China
来源：
FGCN: PROCEEDINGS OF THE 2008 SECOND INTERNATIONAL CONFERENCE ON FUTURE GENERATION COMMUNICATION AND NETWORKING, VOLS 1 AND 2 | 2008年
基金：
中国国家自然科学基金; 美国国家科学基金会;
关键词：
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Searching Steiner free problem is important for optimizing the multicast routing in communication networks. In this paper we study the problem of searching weight constrained minimum cost Steiner tree problem in Halin networks where each edge has a nonnegative integer cost and a nonnegative integer weight. It has been proved to be NP hard. In this paper we give a pseudo algorithm to find the constrained Steiner free in Halin networks.
引用
收藏
页码：421 / +
页数：2
相关论文
共 50 条
  • [41] An online genetic algorithm for dynamic Steiner tree problem
    Ding, S
    Ishii, N
    IECON 2000: 26TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, VOLS 1-4: 21ST CENTURY TECHNOLOGIES AND INDUSTRIAL OPPORTUNITIES, 2000, : 812 - 817
  • [42] A self-stabilizing algorithm for the Steiner tree problem
    Kamei, S
    Kakugawa, H
    21ST IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, 2002, : 396 - 401
  • [43] A distributed delay-constrained multicast tree algorithm in LEO satellite networks
    Wang, L
    Zhang, NT
    57TH IEEE VEHICULAR TECHNOLOGY CONFERENCE, VTC 2003-SPRING, VOLS 1-4, PROCEEDINGS, 2003, : 1391 - 1395
  • [44] An effective heuristic algorithm for finding a Steiner tree in graphs
    Chu, LY
    Shin, DG
    INTERNATIONAL SOCIETY FOR COMPUTERS AND THEIR APPLICATIONS 13TH INTERNATIONAL CONFERENCE ON COMPUTERS AND THEIR APPLICATIONS, 1998, : 121 - 124
  • [45] Solving the degree-constrained Euclidean Steiner minimal tree problem
    Dong Shujuan
    ADVANCED RESEARCH ON INFORMATION SCIENCE, AUTOMATION AND MATERIAL SYSTEM, PTS 1-6, 2011, 219-220 : 652 - 655
  • [46] A Heuristic Algorithm for the Prize Collecting Steiner Tree Problem
    Hosokawa, Y.
    Chiba, E.
    2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, : 99 - 102
  • [47] An Artificial Fish Swarm Algorithm for Steiner Tree Problem
    Ma, Xuan
    Liu, Qing
    2009 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-3, 2009, : 59 - +
  • [48] An improved Physarum polycephalum algorithm for the Steiner tree problem
    Zhang, Yi
    Yang, Zhengquan
    Qi, Xin
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2022, 19 (01) : 40 - 47
  • [49] An Improved Approximation Algorithm for the Terminal Steiner Tree Problem
    Chen, Yen Hung
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2011, PT III, 2011, 6784 : 141 - 151
  • [50] GPSO Hybrid Algorithm for Rectilinear Steiner Tree Optimization
    Nath, Subhrapratim
    Gupta, Sagnik
    Biswas, Saptarshi
    Banerjee, Rupam
    Sing, Jamuna Kanta
    Sarkar, Subir Kumar
    PROCEEDINGS OF 2ND INTERNATIONAL CONFERENCE ON VLSI DEVICE, CIRCUIT AND SYSTEM (IEEE VLSI DCS 2020), 2020, : 365 - 369
12345