Sciweavers

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

31

DAM
2000

favoriteEmaildiscussreport

199views more DAM 2000»

Approximation algorithms for the shortest total path length spanning tree problem

13 years 10 months ago

Approximation algorithms for the shortest total path length spanning tree problem

Download www.csie.ntu.edu.tw

Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang

Real-time Traffic

Approximation Ratio | DAM 2000 | Shortest Total Path | Total Path Length |

claim paper

Related Content

» Approximation Complexity of minmax Regret Versions of Shortest Path Spanning Tree and Knap...

» Approximation Algorithms for Quickest Spanning Tree Problems

» Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

» AverageCase Analyses of Vickrey Costs

» Approximation Algorithms for Some Optimum Communication Spanning Tree Problems

» A PolynomialTime Approximation Scheme for Weighted Planar Graph TSP

» Approximation of minmax and minmax regret versions of some combinatorial optimization prob...

» Lower bounds for the relative greedy algorithm for approximating Steiner trees

» Approximability of Combinatorial Problems with Multiagent Submodular Cost Functions

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	DAM
Authors	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang

Comments (0)