Sciweavers

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

11

JAL
2000

favoriteEmaildiscussreport

74views more JAL 2000»

A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees

13 years 4 months ago

A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees

Download www.csie.ntu.edu.tw

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

Real-time Traffic

JAL 2000 |

claim paper

Related Content

» A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees

» Approximating MinMax Regret Versions of Some Polynomial Problems

» General approximation schemes for minmax regret versions of some pseudopolynomial problems

» GIST GroupIndependent Spanning Tree for Data Aggregation in Dense Sensor Networks

» Approximating minimum bounded degree spanning trees to within one of optimal

» A fully polynomial time approximation scheme for timing driven minimum cost buffer inserti...

» Brief Announcement Universal Data Aggregation Trees for Sensor Networks in Low Doubling Me...

» A polynomial time approximation scheme for timing constrained minimum cost layer assignmen...

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

Post Info
More Details (n/a)

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

Comments (0)