Approximation Ratio of LD Algorithm for Multi-Processor Scheduling and the Coffman-Sethi Conjecture.

Peruvemba Sundaram Ravi Levent Tunçel

Published in: CoRR (2015)

Keyphrases

approximation ratio
np hard
dynamic programming
optimal solution
computational complexity
greedy algorithm
approximation algorithms
reinforcement learning
scheduling problem
worst case
parallel implementation
greedy algorithms
hardware implementation