![]() |
Volumn 3353, Issue , 2004, Pages 189-200
|
The computational complexity of the minimum weight processor assignment problem
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMBINATORIAL OPTIMIZATION;
ENERGY EFFICIENCY;
GRAPH THEORY;
POLYNOMIAL APPROXIMATION;
MULTIMEDIA SYSTEMS;
OPTIMIZATION;
ASSIGNMENT PROBLEMS;
COLORABILITY;
COMMUNICATING TASKS;
ENERGY EFFICIENT;
GRAPH OPTIMIZATION PROBLEMS;
HETEROGENEOUS PROCESSORS;
MAXIMUM DEGREE;
MINIMUM WEIGHT;
MULTIWAY CUT;
PROCESSOR ASSIGNMENTS;
CONTRACTIBLE GRAPH;
POLYNOMIAL-TIME ALGORITHMS;
WEIGHT DIFFERENCE;
MULTIMEDIA SYSTEMS;
GRAPH THEORY;
|
EID: 35048859287
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-540-30559-0_16 Document Type: Article |
Times cited : (3)
|
References (7)
|