On approximating the memory-constrained module allocation problem
DOI10.1016/S0020-0190(97)00008-2zbMATH Open1336.68145OpenAlexW2056244098MaRDI QIDQ286996FDOQ286996
Authors: 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
Recommendations
- A mathematical model and a metaheuristic approach for a memory allocation problem
- A parallel adaptive memory algorithm for the capacitated modular hub location problem
- A modular algorithm for resource allocation
- Application of combinatorial methods in the design of memory allocation algorithms
- FPT approximation algorithm for scheduling with memory constraints
- Approximation algorithms for dynamic storage allocation
- An LC branch-and-bound algorithm for the module assignment problem
- Iterative approaches for a dynamic memory allocation problem in embedded systems
- An approximation algorithm for the register allocation problem
- scientific article; zbMATH DE number 4046862
computational complexitydistributed systemscombinatorial problemspolynomial-time approximation algorithms
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- The Complexity of Multiterminal Cuts
- 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
Cited In (4)
- A parallel adaptive memory algorithm for the capacitated modular hub location problem
- Algorithm for the discrete Weber's problem with an accuracy estimate
- Iterative approaches for a dynamic memory allocation problem in embedded systems
- Parameter tuning of continuous Hopfield network applied to combinatorial optimization
This page was built for publication: On approximating the memory-constrained module allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286996)
