Linear time approximation schemes for parallel processor scheduling.

Y. Kopidakis Didier Fayard Vassilis Zissimopoulos

Published in: SPDP (1996)

Keyphrases

parallel processors
approximation schemes
approximation algorithms
precedence constraints
single processor
worst case
search problems
compute intensive
numerical methods
processing elements
branch and bound algorithm
special case
np hard
error metrics
contract algorithms
image segmentation
computational complexity