New answers tagged

1

The textbook The design of approximation algorithms by Williamson and Shmoys covers many different scheduling and partition problems, and they do so with proofs that are quite accessible.


Top 50 recent answers are included