Heuristics with constant error guarantees for the design of tree networks

A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem

Journal of Heuristics

Coloured Ant System and Local Search to Design Local Telecommunication Networks

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing

A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing

Approximation algorithms for a capacitated network design problem

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization

On the complexity of graph tree partition problems

Discrete Applied Mathematics

Survivable network design: the capacitated minimum spanning network problem

Information Processing Letters

Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design

ACM Transactions on Algorithms (TALG)

Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications

Approximating the minimum quadratic assignment problems

ACM Transactions on Algorithms (TALG)

The (K, k)-capacitated spanning tree problem

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management

Size-constrained tree partitioning: Approximating the multicast k-tree routing problem

Theoretical Computer Science

Improved approximation algorithms for the capacitated multicast routing problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Heuristics for unequal weight delivery problems with a fixed error guarantee

Operations Research Letters