Optimal Time-Critical Scheduling via Resource Augmentation PhillipsSteinWein OriginalPaper Pages: 163 - 200
On the Competitive Theory and Practice of Online List Accessing Algorithms BachrachEl-YanivReinstädtler OriginalPaper Pages: 201 - 245
A Divide-and-Conquer Approach to the Minimum k -Way Cut Problem KamidoiWakabayashiYoshida OriginalPaper Pages: 262 - 276