A linear time approximation algorithm for ruler folding problem
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 2m(1), where m(1) 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{2m(1)- m(1)- m(2)/2(k) - 2, Sigma(k-1)(i=0) m(1)/2(i)} where m(1) and m(2) 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".
approximation algorithms ruler folding problem carpenter's ruler