Improvement of Steiner Tree Algorithm: Branch-Based Multi-Cast

IEICE Transactions on Information and Systems - Japan
doi 10.1587/transinf.e96.d.2743
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Related search

The Minimum Steiner Tree Problem Based on Genetic Algorithm

DEStech Transactions on Computer Science and Engineering
2018English

Performance of a Cavity-Method-Based Algorithm for the Prize-Collecting Steiner Tree Problem on Graphs

Physical Review E
2012English

Separator-Based Pruned Dynamic Programming for Steiner Tree

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Efficient Steiner Tree Construction Based on Spanning Graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
2004English

Steiner Tree Based Distributed Multicast Routing in Networks

Steiner Trees in Industry
2001English

ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm

IEEE Journal on Selected Areas in Communications
Computer NetworksElectronic EngineeringElectricalCommunications
1997English

Obstacle-Avoiding Rectilinear Steiner Tree Construction

2008English

Water-Quality Assessment of Steiner Branch Basin, Lafayette County, Wisconsin

1982English

New Pruning Rules for the Steiner Tree Problem and 2-Connected Steiner Network Problem

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy