On the complexity of decomposing matrices arising in satellite communication

  • Authors:

  • F Rendl

  • Affiliations:

  • Technical University Graz, A-8010 Graz, Austria

  • Venue:
  • Operations Research Letters
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.