Polynomial Time Preemptive Sum-Multicoloring on Paths.

Annamária Kovács

Published in: ICALP (2005)

Keyphrases

min sum
special case
scheduling problem
lower bound
computational complexity
approximation algorithms
weighted sum
priority queue
worst case
single machine
scheduling algorithm
completion times
search engine
absolute difference
neural network
path finding
shortest path
np hardness
case study
e learning
square error