Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > GREEDY HEURISTICS:
Reports tagged with Greedy Heuristics:
TR08-094 | 10th October 2008
Piotr Berman, Marek Karpinski, Alexander Zelikovsky

1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two

We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances one and two, improving on the best known bound for that problem.

more >>>



ISSN 1433-8092 | Imprint