𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new approximation algorithm for sorting of signed permutations

✍ Scribed by Yong He; Ting Chen

Publisher
Springer
Year
2003
Tongue
English
Weight
576 KB
Volume
18
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A loopless algorithm for generating the
A loopless algorithm for generating the permutations of a multiset
✍ Vincent Vajnovszki πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 372 KB

Many combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shu e on trajectories (deΓΏned previou

A CAT algorithm for generating permutati
A CAT algorithm for generating permutations with a fixed number of inversions
✍ Scott Effler; Frank Ruskey πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 103 KB

We develop a constant amortized time (CAT) algorithm for generating permutations with a given number of inversions. We also develop an algorithm for the generation of permutations with given index.