𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the matrix permutation problem

✍ Scribed by M. Tegze; M. Vlach

Book ID
105400153
Publisher
Springer
Year
1986
Tongue
English
Weight
220 KB
Volume
30
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The permutation-path coloring problem on
The permutation-path coloring problem on trees
✍ Sylvie Corteel; Mario Valencia-Pabon; DaniΓ¨le Gardy; Dominique Barth; Alain Deni πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 292 KB

In this paper we ΓΏrst show that the permutation-path coloring problem is NP-hard even for very restrictive instances like involutions, which are permutations that contain only cycles of length at most two, on both binary trees and on trees having only two vertices with degree greater than two, and f

The three-permutations problem
The three-permutations problem
✍ P.C. Fishburn; W.V. Gehrlein πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 332 KB

Given any three permutations on { 1, . . , n}, we want to choose f : { 1, . . . , n} + { -1, 1) so that the maximum absolute partial sum off values over the permutations is minimized. The three-permutations problem is to determine the supremum of this minimum taken over all n and all triples of perm