most citedExact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CC2017★ 1 cited

Exact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice

Lei Shang

This PhD thesis summarizes research works on the design of exact algorithms that provide a worst-case (time or space) guarantee for NP-hard scheduling problems. Both theoretical an…