A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Bicriteria network design problems
Journal of Algorithms
An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions
Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computing all efficient solutions of the biobjective minimum spanning tree problem
Computers and Operations Research
A Survey on Multiple Objective Minimum Spanning Tree Problems
Algorithmics of Large and Complex Networks
A bi-criteria algorithm for multipoint-to-multipoint virtual connections in transport networks
Proceedings of the 7th International Conference on Network and Services Management
MAMCRA: a constrained-based multicast routing algorithm
Computer Communications
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper, an improved version of a previously proposed heuristic that finds 'good' compromise solutions for a bi-criteria Steiner trees problem is presented. This bi-criteria formulation of the Steiner's tree problem is well suited for application in telecommunication networks whenever it is important to find the minimum amount of resources to connect a given subset of network nodes. In fact there are some (additive) metrics that may not lead to a tree with the minimum number of Steiner nodes when used in the single criterion Steiner's tree problem. In this case it can be advantageous to consider also the minimisation of the hop count as a second criteria in the problem formulation. The performance of the new heuristic is evaluated and compared with the previous version by recurring to reference networks from a library of Steiner's tree problems.