Sciweavers

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

100

Voted

SODA
2001
ACM

100views Algorithms» more SODA 2001»

Practical approximation algorithms for zero- and bounded-skew trees

15 years 4 months ago

Practical approximation algorithms for zero- and bounded-skew trees

Download www.engr.uconn.edu

Alexander Zelikovsky, Ion I. Mandoiu

Real-time Traffic

Algorithms | SODA 2001 |

claim paper

Related Content

» More Practical BoundedSkew Clock Routing

» On Location and Approximation of Clusters of Zeros Case of Embedding Dimension One

» On Fast and Approximate Attack Tree Computations

» An Approximation Algorithm for Binary Searching in Trees

» An Investigation of Practical Approximate Nearest Neighbor Algorithms

» Approximately Optimal Trees for Group Key Management with Batch Updates

» Approximating Spanning Trees with Inner Nodes Cost

» Optimal triangulation and quadricbased surface simplification

» Tight Bounds for Wavelength Assignment on Trees of Rings

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	SODA
Authors	Alexander Zelikovsky, Ion I. Mandoiu

Comments (0)