Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Longest Common Separable Pattern Among Permutations
verfasst von : Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
Erschienen in: Combinatorial Pattern Matching
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we study the problem of finding the longest common separable pattern among several permutations. We first give a polynomial-time algorithm when the number of input permutations is fixed and next show that the problem is
NP
–hardfor an arbitrary number of input permutations even if these permutations are separable.
On the other hand, we show that the
NP
–hardproblem of finding the longest common pattern between two permutations cannot be approximated better than within a ratio of
(where
is the size of an optimal solution) when taking common patterns belonging to pattern-avoiding permutation classes.