On the complexity of decomposing matrices arising in satellite communication (Q1060960)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of decomposing matrices arising in satellite communication |
scientific article; zbMATH DE number 3910138
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of decomposing matrices arising in satellite communication |
scientific article; zbMATH DE number 3910138 |
Statements
On the complexity of decomposing matrices arising in satellite communication (English)
0 references
1985
0 references
Decomposing a square matrix into a weighted sum of permutation matrices, such that the sum of the weights becomes minimal, is NP-hard. This result justifies the heuristic approach to this problem proposed by several authors. An application of this problem arises from intercity communication via transmission satellites.
0 references
computational complexity
0 references
communication matrices
0 references
matrix decomposition
0 references
Decomposing a square matrix
0 references
weighted sum of permutation matrices
0 references
heuristic
0 references
intercity communication
0 references
transmission satellites
0 references
0.87709653
0 references
0.8627435
0 references
0.8477094
0 references
0.84739697
0 references
0.8350892
0 references
0.8287148
0 references
0.8280393
0 references
0.82781595
0 references
0.82718754
0 references
