Weak Algebraic Monge Arrays - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

Weak Algebraic Monge Arrays

Rüdiger Rudolf
  • Function : Author
Dominique Fortin
  • Function : Author


An $n\times n$ matrix $C$ is called a {\em weak Monge\/} matrix iff $c_{ii}+c_{rs}\le c_{is}+c_{ri}$ for all $1\le i\le r,s\le n$. It is well known that the classical linear assignment problem is optimally solved by the identity permutation if the underlying cost-matrix fulfills the weak Monge property. In this paper we introduce higher dimensional weak Monge arrays and prove that higher dimensional axial assignment problems can be solved efficiently if the cost-structure is a higher dimensional weak Monge array. Additionally, the concept of weak Monge arrays is related to other Monge properties and extended in an algebraic framework. Finally, the problem of testing whether or not a given array can be permuted to become a weak Monge array is solved.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2501.pdf (297.73 Ko) Télécharger le fichier

Dates and versions

inria-00074176 , version 1 (24-05-2006)


  • HAL Id : inria-00074176 , version 1


Rüdiger Rudolf, Dominique Fortin. Weak Algebraic Monge Arrays. [Research Report] RR-2501, INRIA. 1995. ⟨inria-00074176⟩
91 View
60 Download


Gmail Facebook Twitter LinkedIn More