Abstract
We study various computational aspects of the problem of determining whether a given order contains a given sub-order. Formally, given a permutation π on k elements, and a permutation σ on n > k elements, the goal is to determine whether there exists a strictly increasing function f from [1..k] to [1..n] which is order preserving, i.e., f satisfies σ(f(i)) > σ(f(j)) whenever π(i) > π(j). We call this decision problem the Sub-Permutation Problem.
The study falls into two parts. In the first part we develop and analyze an algorithm (or, rather, an algorithmic paradigm) for this problem. We show that the complexity of this algorithm is at most O(n 1+C(π)), where C(π) is a naturally defined function of the permutation π.
In the second part we study C(π). In particular, we show that C(π) ≤ 0.35k + o(k), implying that the complexity of the Sub-Permutation problem is O(c k +n0.35k+0(k)). On the other hand, we prove that for most π’s, C(π) = Ω(k), establishing a lower bound for our algorithm. In addition, we develop a fast polylogarithmic approximation algorithm for computing C(π), and bound the value of this parameter for some interesting families of permutations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alon N., Friedgut E., On the number of permutations avoiding a given pattern. JCTS, in press.
Alon N., Spencer J. H., Erdos P., The Probabilistic Method, Wiley-Interscience, pp. 83–93, 1991.
Bona M., Exact enumeration of 1342-avoiding permutations; A close link with labeled trees and planar maps, Journal of Combinatorial Theory, Series A, 80, pp. 257–272, 1997.
Bose P., Buss J. F., Lubiw A., Pattern matching for permutations, Proceeding of the 3rd Workshop on Algorithms and Data Structures, 1993.
Leighton F.T., Rao S., An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceeding of 29-th FOCS, 1988, pp.422–431.
McDiarmid C., Concentration. In Probabilistic methods for Algorithms and Discrete Mathematics, Ed. Habib et al., Springer 1998. pp. 195–248.
Spielman A. D., Teng S., Spectral partitioning works: planar graphs and finite element meshes, Proceeding of the 37th Annual IEEE Conference on Foundations of Computer Science, 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahal, S., Rabinovich, Y. (2000). On the Complexity of the Sub-permutation Problem. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_41
Download citation
DOI: https://doi.org/10.1007/3-540-44985-X_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67690-4
Online ISBN: 978-3-540-44985-0
eBook Packages: Springer Book Archive