Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

ISAAC
2001
Springer

favoriteEmaildiscussreport

99views Algorithms» more ISAAC 2001»

Tree-Approximations for the Weighted Cost-Distance Problem

14 years 3 months ago

Tree-Approximations for the Weighted Cost-Distance Problem

Download cone.informatik.uni-freiburg.de

Christian Schindelhauer, Birgitta Weber

Real-time Traffic

Algorithms | ISAAC 2001 |

claim paper

Related Content

» Improved Steiner tree approximation in graphs

» STAR SteinerTree Approximation in Relationship Graphs

» A 25Factor Approximation Algorithm for the kMST Problem

» Approximating discrete probability distributions with causal dependence trees

» On TreeConstrained Matchings and Generalizations

» Approximation Algorithms for the Maxcoloring Problem

» Embedding metrics into ultrametrics and graphs into spanning trees with constant average d...

» Efficient Evaluation of Multiple Preference Queries

» New Approaches for Virtual Private Network Design

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	ISAAC
Authors	Christian Schindelhauer, Birgitta Weber

Comments (0)