Heuristic algorithms for packing of multiple-group multicasting

DOI10.1016/S0305-0548(00)00092-7zbMath0995.90084OpenAlexW2094710049MaRDI QIDQ5959379

Rong-Hong Jan, Chu-Fu Wang, Chun-Teng Liang

Publication date: 24 October 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00092-7

zbMATH Keywords

Steiner tree problemnetwork optimizationmulticast routingshortest path problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

A survey of combinatorial optimization problems in multicast routing ⋮ Biclique completion problems for multicast network design ⋮ Multiple multicast tree allocation in IP network. ⋮ On routing in VLSI design and communication networks ⋮ Packing trees in communication networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on A faster approximation algorithm for the Steiner problem in graphs
• Path-distance heuristic for the Steiner problem in undirected networks
• Optimum and multicast of multimedia streams
• A dual ascent approach for steiner tree problems on a directed graph
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• On finding steiner vertices
• Steiner problem in networks: A survey
• Multi-Terminal Network Flows
• Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
• Steiner's problem in graphs and its implications
• The steiner problem in graphs
• A lower bound for the steiner tree problem in directed graphs
• An algorithm for the steiner problem in graphs
• An algorithm for the steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• Steiner tree problems