Heterogeneous Matrix-Matrix Multiplication or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms.
Olivier BeaumontVincent BoudetArnaud LegrandFabrice RastelloYves RobertPublished in: PDP (2001)
Keyphrases
- approximation algorithms
- matrix multiplication
- np hard
- message passing
- special case
- vertex cover
- worst case
- minimum cost
- distributed memory
- facility location problem
- matrix factorization
- network design problem
- open shop
- approximation schemes
- constant factor approximation
- primal dual
- set cover
- np hardness
- approximation ratio
- constant factor
- undirected graph
- precedence constraints
- combinatorial auctions
- bayesian networks