Login / Signup
Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals.
Imed Kacem
Hans Kellerer
Yann Lanuel
Published in:
J. Comb. Optim. (2015)
Keyphrases
</>
approximation algorithms
constant factor
np hard
special case
worst case
primal dual
undirected graph
facility location problem
constant factor approximation
finite number
network design problem
randomized algorithms
disjoint paths