Showing papers by "Ming-Yang Kao published in 2013"
16 Dec 2013
TL;DR: The \(\mathcal{NP}\)-hardness of 29-PATS is proved, where the best known is that of 60-PATs, which is a variant of PATS that restricts input patterns to those with at most k colors.
Abstract: Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular pattern. For k ≥ 1, k-PATS is a variant of PATS that restricts input patterns to those with at most k colors. We prove the \(\mathcal{NP}\)-hardness of 29-PATS, where the best known is that of 60-PATS.
10 citations
16 Apr 2013
TL;DR: This paper presents an efficient algorithm for finding the optimal k-cuts of a nondecreasing array of size n that produces the maximum area under the points and believes that an O(kn) time algorithm exists and shows a heuristic algorithm.
Abstract: This paper presents an efficient algorithm for finding the optimal k-cuts of a nondecreasing array of size n that produces the maximum area under the points. The naive approach uses a dynamic programming algorithm which requires O(kn2) time, where n is the size of the array. This algorithm is time consuming for large n or k and thus inappropriate. We design faster algorithms by discovering and proving some nice properties of the nondecreasing arrays, finding convex hull, and by continuous-to-discrete transformation. We believe that an O(kn) time algorithm exists and show a heuristic algorithm.