Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with relaxation:
TR00-047 | 29th June 2000
Tobias Polzin, Siavash Vahdati Daneshmand

Primal-Dual Approaches to the Steiner Problem

We study several old and new algorithms for computing lower
and upper bounds for the Steiner problem in networks using dual-ascent
and primal-dual strategies. These strategies have been proven to be
very useful for the algorithmic treatment of the Steiner problem. We
show that none of the known algorithms ... more >>>

ISSN 1433-8092 | Imprint