Sciweavers

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

12

ICALP
1997
Springer

favoriteEmaildiscussreport

79views Programming Languages» more ICALP 1997»

Improving Spanning Trees by Upgrading Nodes

13 years 8 months ago

Improving Spanning Trees by Upgrading Nodes

Download www.ccs.neu.edu

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Nol

Real-time Traffic

ICALP 1997 | Programming Languages |

claim paper

Related Content

» Distributed Computation of All Node Replacements of a Minimum Spanning Tree

» Trusted Spanning Tree for Delay Tolerant MANETs

» An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

» Variable Neighborhood Search and Ant Colony Optimization for the Rooted DelayConstrained M...

» Greedy Heuristics and an Evolutionary Algorithm for the BoundedDiameter Minimum Spanning T...

» An Improved LPbased Approximation for Steiner Tree

» Fast Data Collection in TreeBased Wireless Sensor Networks

» Sharp Separation and Applications to Exact and Parameterized Algorithms

» Distributed Protocols for Finding LowCost Broadcast and Multicast Trees in Wireless Networ...

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1997
Where	ICALP
Authors	Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth

Comments (0)