摘要：AbstractIn this paper, we outline a method for carrying out efficient (max, +) matrix multiplication when using the heaps of pieces framework. We present an algorithm for multiplying an arbitrarymbyrmatrixXby arbyrheaps of pieces matrix M, making it possible to calculate the resulting matrix in worst case time complexityO(mr),rather thanO(mr2)which is required when using the matrix multiplication definition. We also give an algorithm for multiplyingMby an arbitraryrbynmatrixXwith worst case time complexityO(nr).Finally, we consider a variant of the standard heaps of pieces model, and present an improved matrix multiplication algorithm for this variant as well.
关键词：Keywordssupervisory controlheaps of piecesmax-plus algebramatrix multiplicationtime complexity
