On approximating the memory-constrained module allocation problem

DOI10.1016/S0020-0190(97)00008-2zbMath1336.68145OpenAlexW2056244098MaRDI QIDQ286996

Frédéric Roupin

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00008-2

zbMATH Keywords

computational complexitydistributed systemscombinatorial problemspolynomial-time approximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Approximation algorithms (68W25)

Related Items (1)

Algorithm for the discrete Weber's problem with an accuracy estimate

Cites Work

• Unnamed Item
• One-Half Approximation Algorithms for the k-Partition Problem
• Placement de tâches dans un système distribué et dualité lagrangienne
• Critical Load Factors in Two-Processor Distributed Systems
• Assignment of Tasks in a Distributed Processor System with Limited Memory
• The Complexity of Multiterminal Cuts

This page was built for publication: On approximating the memory-constrained module allocation problem