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

JUCS

2008

2008

: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ruler Folding Problem", which is NP-Complete is to find the minimum length of the folded chain. The best linear approximation algorithm for it were proposed by Hopcroft et al. Their algorithm folds any open chain in the interval whose length is less than 2m1, where m1 is the length of the longest link in the chain. We propose a linear time approximation algorithm using O(1) additional space. Our algorithm has lower upper bound for the length of the folded chain which is max{2m1 - m1-m2 2k-2 , k-1 i=0 m1 2i }, where m1 and m2 are the lengths of the two distinct maximum length links in the chain respectively, and k is the number of links whose lengths are m1 in the chain. Hence it is the best known approximation algorithm for "Ruler Folding Problem". Key Words: Ruler Folding Problem, Carpenter'...

Related Content

Added |
13 Dec 2010 |

Updated |
13 Dec 2010 |

Type |
Journal |

Year |
2008 |

Where |
JUCS |

Authors |
Ali Nourollah, Mohammadreza Razzazi |

Comments (0)