Longest Common Separable Pattern between Permutations

Details Longest Common Separable Pattern between Permutations Longest Common Separable Pattern between Permutations

2007-02-05

arxiv.org/abs/math/0702109v1

Combinatorial Pattern Matching (CPM) 2007 (2007) 00

Mathematics

Combinatorics

15 pages

Scientific paper

In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input permutations is fixed and show that the problem is NP-hard for an arbitrary number of input permutations even if these permutations are separable. On the other hand, we show that the NP-hard problem of finding the longest common pattern between two permutations cannot be approximated better than within a ratio of $sqrt{Opt}$ (where $Opt$ is the size of an optimal solution) when taking common patterns belonging to pattern-avoiding classes of permutations.

Affiliated with

Also associated with

No associations

Rating

Longest Common Separable Pattern between Permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Longest Common Separable Pattern between Permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Longest Common Separable Pattern between Permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-714496