Sciweavers

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

7

CIAC
2006
Springer

favoriteEmaildiscussreport

110views Algorithms» more CIAC 2006»

Distance Approximating Trees: Complexity and Algorithms

13 years 8 months ago

Distance Approximating Trees: Complexity and Algorithms

Download www.cs.kent.edu

Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )

Feodor F. Dragan, Chenyu Yan

Real-time Traffic

)-approximating Tree | )-approximating Tree Problem | Algorithms | CIAC 2006 | Tree Problem |

claim paper

Related Content

» TASM Topk Approximate Subtree Matching

» TreeApproximations for the Weighted CostDistance Problem

» Space Efficient Algorithms for Ordered Tree Comparison

» Approximating discrete probability distributions with causal dependence trees

» Approximate Maximum Parsimony and Ancestral Maximum Likelihood

» On the complexity and approximation of syntenic distance

» Approximating Minimum MaxStretch spanning Trees on unweighted graphs

» A quadratic regulatorbased heuristic for rapidly exploring state space

» A subset spanner for Planar graphs with application to subset TSP

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CIAC
Authors	Feodor F. Dragan, Chenyu Yan

Comments (0)