Steiner trees in uniformly quasi-bipartite graphs

13 years 10 months ago

Download www.inf.fu-berlin.de

The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation

Clemens Gröpl, Stefan Hougardy, Till Nierhoff

Real-time Traffic

Approximation Algorithms | Continuous Progress | IPL 2002 | Steiner Tree Problem |

claim paper

» TwoStage Robust Network Design with Exponential Scenarios

» Deploying Mesh Nodes under NonUniform Propagation

» Stochastic analyses for online combinatorial optimization problems

» Stability of a Multicast Tree

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	IPL
Authors	Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel

Comments (0)

Sciweavers

Steiner trees in uniformly quasi-bipartite graphs

Approximation Algorithms | Continuous Progress | IPL 2002 | Steiner Tree Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers