Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
20
click to vote
CIAC
2006
Springer
favorite
Email
discuss
report
110
views
Algorithms
»
more
CIAC 2006
»
Distance Approximating Trees: Complexity and Algorithms
14 years 2 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision