Sciweavers

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

7

CCCG
2003

favoriteEmaildiscussreport

89views Computational Geometry» more CCCG 2003»

Approximating the geometric minimum-diameter spanning tree

13 years 6 months ago

Approximating the geometric minimum-diameter spanning tree

Download i11www.iti.uni-karlsruhe.de

Michael J. Spriggs, J. Mark Keil, Sergei Bespamyat

Real-time Traffic

CCCG 2003 | CCCG 2007 |

claim paper

Related Content

» Approximating the DegreeBounded Minimum Diameter Spanning Tree Problem

» Some Structural and Geometric Properties of TwoConnected Steiner Networks

» DepthLatency Tradeoffs in Multicast Tree Algorithms

» Minimizing the stabbing number of matchings trees and triangulations

» Coresets in dynamic geometric data streams

» Spanners for Geometric Intersection Graphs

» Messageoptimal connected dominating sets in mobile ad hoc networks

» Dynamical Construction of a CoreBased GroupShared Multicast Tree in Mobile Ad Hoc Networks

» Long Noncrossing Configurations in the Plane

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	CCCG
Authors	Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink

Comments (0)