Sciweavers

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

99

ISAAC
2010
Springer

240views Algorithms» more ISAAC 2010»

An Optimal Algorithm for Computing Angle-Constrained Spanners

15 years 1 months ago

An Optimal Algorithm for Computing Angle-Constrained Spanners

Download people.scs.carleton.ca

Paz Carmi, Michiel H. M. Smid

Real-time Traffic

Algorithms | ISAAC 2010 |

claim paper

Related Content

» Computing the Greedy Spanner in NearQuadratic Time

» Distributed algorithms for ultrasparse spanners and linear size skeletons

» Faulttolerant spanners for general graphs

» Relaxed Spanners for Directed Disk Graphs

» Approximating Maximum Flow in Polygonal Domains using Spanners

» On ChannelDiscontinuityConstraint Routing in Wireless Networks

Post Info
More Details (n/a)

Added	13 Feb 2011
Updated	13 Feb 2011
Type	Journal
Year	2010
Where	ISAAC
Authors	Paz Carmi, Michiel H. M. Smid

Comments (0)