What people are saying - Write a review
We haven't found any reviews in the usual places.
Complexity of Exact and Approximate Solution of Problems An Introduction
Models of the Task Assignment Problem in Distributed Systems
Approximation Algorithms for BinPacking An Updated Survey
6 other sections not shown
Other editions - View all
analysis approximation algorithms architecture asymptotic average bin-packing capacity cell closure Coffman combinatorial combinatorial optimization Comp complexity Computer Science computer systems considered constraints corresponding cost distributed dotted FD-path equivalent example exists FD-graph FIT DECREASING flow Garey given hypergraph graph height heuristic hyperarc hypergraph hyperpath IEEE input integer interconnection item sizes knapsack problem layout Lemma lenght linear lower bound LR-minimum LUCERTINI Lueker MIMD minimal coverings minimum multiprocessor scheduling nonredundant NP-complete NP-hard number of bins number of nodes objective function obtained on-line algorithm optimal solution optimization problems packing algorithms packing problem paper parallel algorithms parallel computer parallel machines partitioning performance planar graphs polynomial Proc processing processors programming proof PSPACE rectangle redundant nodes sequence shown SIAM SM-covering solved source sets strip packing structure subhypergraph SUBSET-SUM techniques THEOREM tion transitive reduction tree Turing machines vector VLSI width worst