An approximation result for a duo-processor task scheduling problem

Authors:
P. Dell'Olmo;S. Giordani;M. G. Speranza
Affiliations:
-;-;-
Venue:
Information Processing Letters
Year:
1997

Citing 0
Cited 2

An approximation result for the interval coloring problem on claw-free chordal graphs

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Complexity and approximation results for scheduling multiprocessor tasks on a ring

Discrete Applied Mathematics - International symposium on combinatorial optimisation

Quantified Score

Hi-index	0.89

Visualization

Abstract