Abstract. We present polynomial–time approximation algorithms for string folding problems over any finite alphabet. Our idea is the following:.
Aug 24, 2001 · We present polynomial-time approximation algorithms for string folding problems over any finite alphabet. Our idea is the following: ...
Topics · Infinite Alphabets · Configuration · Bijection · Parse Trees · Approximation Algorithms · Embeddings · Parsing Algorithm · Polynomial Time Approximation ...
In this paper, we first present a new 3/8-approximation algorithm for the 3D folding problem that improves on the absolute approximation guarantee of the ...
Abstract. We present polynomial-time approximation algorithms for string folding problems over any finite alphabet. ... Approximation algorithms for string ...
People also ask
What is a 3 approximation algorithm?
What is the 2-approximation algorithm?
What is an example of an approximation algorithm?
What is the K approximation algorithm?
Abstract. We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a ...
Abstract. We present the rst proof of NP-hardness (under random- ized polynomial time reductions) for string folding prob- lems over a nite alphabet.
Aug 31, 2004 · gave approximation algorithms for the string folding problem on the 2D and 3D triangular lattice with approximation guarantees of slightly ...
Abstract. The Dyck language, which consists of well-balanced sequences of parentheses, is one of the most fundamental context-free languages.
We now present a 1/3-approximation algorithm for the problem of folding a string of O's and l's on the 2D square lattice so as to maximize the number of ...