On approximating the memory-constrained module allocation problem
From MaRDI portal
Publication:286996
DOI10.1016/S0020-0190(97)00008-2zbMath1336.68145MaRDI QIDQ286996
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
computational complexity; distributed systems; combinatorial problems; polynomial-time approximation algorithms
68Q25: Analysis of algorithms and problem complexity
68M14: Distributed systems
68W25: Approximation algorithms