Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > OPTIMAL SOLUTIONS:
Reports tagged with Optimal Solutions:
TR95-030 | 20th June 1995
Marek Karpinski, Alexander Zelikovsky

New Approximation Algorithms for the Steiner Tree Problems

The Steiner tree problem asks for the shortest tree connecting
a given set of terminal points in a metric space. We design
new approximation algorithms for the Steiner tree problems
using a novel technique of choosing Steiner points in dependence
on the possible deviation from ... more >>>




ISSN 1433-8092 | Imprint