Sciweavers

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

34

DAM
1998

favoriteEmaildiscussreport

66views more DAM 1998»

Approximation Algorithms for Minimum Tree Partition

13 years 10 months ago

Approximation Algorithms for Minimum Tree Partition

Download www.math.tau.ac.il

Nili Guttmann-Beck, Refael Hassin

Real-time Traffic

DAM 1998 |

claim paper

Related Content

» Tree edge decomposition with an application to minimum ultrametric tree approximation

» Lower bounds for approximate polygon decomposition and minimum gap

» A distributed approximation algorithm for the minimum degree minimum weight spanning trees

» Normalized tree partitioning for image segmentation

» Analysis and approximation for bank selection instruction minimization on partitioned memo...

» Circular partitions with applications to visualization and embeddings

» Minimum Common String Partition Problem Hardness and Approximations

» Approximating Minimum MaxStretch spanning Trees on unweighted graphs

» Approximating discrete probability distributions with causal dependence trees

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	DAM
Authors	Nili Guttmann-Beck, Refael Hassin

Comments (0)