A High Performance Approximate Algorithm for the Steiner Problem in Graphs

Authors:
Pere Guitart;Josep M. Basart
Affiliations:
-;-
Venue:
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Year:
1998

Citing 3
Cited 0

On finding Steiner vertices

Networks
An architecture-independent approach to FPGA routing based on multi-weighted graphs

EURO-DAC '94 Proceedings of the conference on European design automation
Finding (Near-)Optimal Steiner Trees in Large Graphs

Proceedings of the 6th International Conference on Genetic Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approximate algorithm (GBA) for the Steiner problem in graphs (SPG) based on an iterative execution of a previous heuristic to the problem (SPH) is presented. GBA looks for a subset of vertices which, used as terminals, can produce a near-optimal solution. In addition, the tree associated to each of these subsets is selected at random. The worst-case time complexity of the algorithm is O(|V|3) and the cost of the solution is guaranteed to be less than twice the optimal. GBA is tested on classical benchmark problems and its performance compares favorably to that of some of the best existing SPG approaches with respect both to solution quality and specially runtime.