Longest Common Separable Pattern between Permutations
| dc.creator | Bouvel, Mathilde | |
| dc.creator | Rossin, Dominique | |
| dc.creator | Vialette, Stephane | |
| dc.date | 2007-02-05 | |
| dc.date.accessioned | 2026-07-07T08:08:40Z | |
| dc.date.available | 2026-07-07T08:08:40Z | |
| dc.description | 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. | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/math/0702109 | |
| dc.identifier | http://arxiv.org/abs/math/0702109 | |
| dc.identifier | Combinatorial Pattern Matching (CPM) 2007 (2007) 00 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131340 | |
| dc.subject | Combinatorics | |
| dc.subject | Computational Complexity | |
| dc.subject | 05A05 - 05C12 - 05C85 - 05C05- 90C39 | |
| dc.title | Longest Common Separable Pattern between Permutations | |
| dc.type | text |