Probabilistic analysis of an algorithm for the \(m\)-planar 3-index assignment problem on single-cycle permutations on one-cycle permutations (Q5264723)
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 6466081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic analysis of an algorithm for the \(m\)-planar 3-index assignment problem on single-cycle permutations on one-cycle permutations |
scientific article; zbMATH DE number 6466081 |
Statements
Probabilistic analysis of an algorithm for the m-planar 3-index assignment problem on single-cycle permutations (English)
0 references
27 July 2015
0 references
\(m\)-planar 3-dimensional assignment problem
0 references
one-cycle permutation
0 references
\(m\)-PSP with different weight functions
0 references
polynomial approximation algorithm
0 references
asymptotic optimality
0 references
0.8659387826919556
0 references
0.8155255913734436
0 references
0.8154003620147705
0 references
0.8142044544219971
0 references
