On the complexity of decomposing matrices arising in satellite communication (Q1060960): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Traffic assignment in communication satellites / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of a 3-dimensional assignment problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of decomposing matrices arising in satellite communication / rank | |||
Normal rank | |||
Latest revision as of 18:24, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of decomposing matrices arising in satellite communication |
scientific article |
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
