Sciweavers

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

50

Voted

COMPGEOM
2006
ACM

favoriteEmaildiscussreport

78views Discrete Geometry» more COMPGEOM 2006»

Tight bounds for connecting sites across barriers

15 years 3 months ago

Tight bounds for connecting sites across barriers

Download www.cs.tufts.edu

David W. Krumme, Eynat Rafalin, Diane L. Souvaine,

Real-time Traffic

COMPGEOM 2006 |

claim paper

Related Content

» Cuttings for Disks and AxisAligned Rectangles

» Relative Convex Hulls in Semidynamic Subdivisions

» The Costs and Limits of Availability for Replicated Services

» TradeOff Results for Connection Management

» Analysis of two Sweepline Algorithms for Constructing Spanning Trees and Steiner Trees

» Distributed Constrained Optimization with Semicoordinate Transformations

Post Info
More Details (n/a)

Added	13 Jun 2010
Updated	13 Jun 2010
Type	Conference
Year	2006
Where	COMPGEOM
Authors	David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth

Comments (0)