NP-completeness of some optimal sequencing problems with a given grouping of elements (Q4723552)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3995427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of some optimal sequencing problems with a given grouping of elements |
scientific article; zbMATH DE number 3995427 |
Statements
NP-completeness of some optimal sequencing problems with a given grouping of elements (English)
0 references
1985
0 references
sequencing
0 references
permutation
0 references
NP-hard
0 references
0.8606379
0 references
0.85506773
0 references
0.8520615
0 references
0.8508915
0 references
0.84886986
0 references
0.8469906
0 references
0.84527075
0 references
0.84461606
0 references
For \(N=\{1,...,n\}\) and some subset \(M\subseteq N\) denote by c(M) the number of subsets C of M which have the form \(C=\{l,l+1,...,l+r\}\) with l-1\(\not\in M\) and \(l+r+1\not\in M\). For some permutation \(\pi =(i_ 1,...,i_ n)\) of the elements in N define \[ (1)\quad F(\pi)=\sum^{n}_{k=1}f(c(\{i_ 1,...,i_ k\})) \] where f is a nondecreasing function. Furthermore let \(N_ 1,...,N_ s\) be a partition of N into pairwise disjoint and nonempty sets \(N_ i\). Denote by \(\Pi\) the set of all permutations \(\pi\) of the form \(\pi =(\pi_{q_ 1},...,\pi_{q_ s})\) where \(\pi_{q_ i}\) is a permutation of the subset \(N_ i\) \((i=1,...,s)\). It is shown that the problem of finding a permutation \(\pi\in \Pi\) which minimizes (1) is NP-hard. However, if \(\Pi\) is restricted to the set of all permutations of the form \((\pi_ 1,...,\pi_ s)\) the problem can be solved in O(n log n) steps, which was shown in an earlier paper of the first author.
0 references