Sciweavers

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

87

Voted

CN
2008

93views more CN 2008»

A fast algorithm for computing minimum routing cost spanning trees

15 years 2 months ago

A fast algorithm for computing minimum routing cost spanning trees

Download telecom.inescporto.pt

Rui Campos, Manuel Ricardo

Real-time Traffic

CN 2008 |

claim paper

Related Content

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

» The blob code is competitive with edgesets in genetic algorithms for the minimum routing c...

» Least Cost Multicast Spanning Tree Algorithm for Local Computer Network

» Fast sharedmemory algorithms for computing the minimum spanning forest of sparse graphs

» A Weighted Coding in a Genetic Algorithm for the DegreeConstrained Minimum Spanning Tree P...

» Fast minimum spanning tree for large graphs on the GPU

» Fast SelfStabilizing Minimum Spanning Tree Construction

» A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tre...

» A Benders decomposition approach for the robust spanning tree problem with interval data

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CN
Authors	Rui Campos, Manuel Ricardo

Comments (0)