Download "Optimal Partitioning of Sequences. Abstract. The problem of partitioning a sequence of n real numbers into p intervals"
Greedy algorithms is another useful way for solving optimization problems.
Rectilinear and Polygonal p-piercing and p-center Problems. Micha Sharir y Emo Welzl z. 1 Introduction. piercing points.
Scheduling Periodic and Aperiodic. John P. Lehoczky and Sandra R. Thuel. and both hard and soft deadline aperiodic tasks using xed-priority methods.
NEW STABILITY RESULTS FOR ADVERSARIAL QUEUING ZVI LOTKER, BOAZ PATT-SHAMIR, AND ADI ROSÉN Abstract. We consider the model of adversarial queuing theory for packet networks introduced by Borodin et al.