Sciweavers

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

91

SODA
1994
ACM

81views Algorithms» more SODA 1994»

Spanning Trees Short or Small

15 years 3 months ago

Spanning Trees Short or Small

Download www.ccs.neu.edu

R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel

Real-time Traffic

Algorithms | SODA 1994 |

claim paper

Related Content

» LinearTime Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs

» Supereulerian planar graphs

» Least Cost Multicast Spanning Tree Algorithm for Local Computer Network

» Approximating khop Minimum Spanning Trees in Euclidean Metrics

» Light Orthogonal Networks with Constant Geometric Dilation

» Collective operations for widearea message passing systems using adaptive spanning trees

» Minimum Spanning Tree Problem with Label Selection

» Distributed Spanning Tree Algorithms for Large Scale Traversals

» Brief announcement minimum spanning trees and conebased topology control

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1994
Where	SODA
Authors	R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi

Comments (0)