Approximation algorithms for some optimum communication spanning tree problems

A polynomial time approximation scheme for the two-source minimum routing cost spanning trees

Journal of Algorithms

Low Stretch Spanning Trees

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

The complexity of minimizing certain cost metrics for k-source spanning trees

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"

Multi-source spanning trees: algorithms for minimizing source eccentricities

Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)

Approximation algorithms for the optimal p-source communication spanning tree

Discrete Applied Mathematics

An improved algorithm for the k-source maximum eccentricity spanning trees

Discrete Applied Mathematics

Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs

Information Processing Letters

On the intercluster distance of a tree metric

Theoretical Computer Science

Orientation matters: how to efficiently solve ocst problems with problem-specific EAs

Proceedings of the 10th annual conference on Genetic and evolutionary computation

New insights into the OCST problem: integrating node degrees and their location in the graph

Proceedings of the 11th Annual conference on Genetic and evolutionary computation

The complexity of minimizing certain cost metrics for k-source spanning trees

Discrete Applied Mathematics

A memetic algorithm for the optimum communication spanning tree problem

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics

Approximation algorithms for 2-source minimum routing cost k-tree problems

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III

Finding best swap edges minimizing the routing cost of a spanning tree

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science

Evolutionary local search for designing peer-to-peer overlay topologies based on minimum routing cost spanning trees

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature

The fuzzy weighted k-cardinality tree and its hybrid genetic algorithm

FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery