Efficient cycle search for the minimum routing cost spanning tree problem

Authors:
Steffen Wolf;Peter Merz
Affiliations:
University of Kaiserslautern, Kaiserslautern, Germany;University of Applied Sciences and Arts, Hannover, Hannover, Germany
Venue:
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2010

Citing 5
Cited 0

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
PlanetLab: an overlay testbed for broad-coverage services

ACM SIGCOMM Computer Communication Review
A New Heuristic for the Minimum Routing Cost Spanning Tree Problem

ICIT '08 Proceedings of the 2008 International Conference on Information Technology
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Minimum Routing Cost Spanning Tree problem is an optimization problem that strongly benefits from local search. Well-established approaches are the Ahuja-Murty local search and a weaker subtree search used in an evolutionary framework. We present a new and efficient cycle search that has a lower time complexity but achieves the same results as the strong but slow Ahuja-Murty local search. Moreover, we show that an evolutionary framework using this cycle search outperforms previous approaches regarding both quality and time. Our approach is able to find (near-)optimal solutions in all runs for all tested instances.