Randomized Priority Algorithms [chapter]

Spyros Angelopoulos
2004 Lecture Notes in Computer Science  
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effect of randomization in greedy-like algorithms. More specifically, we consider approximation ratios within the context of randomized priority algorithms. As case studies, we prove inapproximation results for two well-studied optimization problems, namely facility location and makespan scheduling.
doi:10.1007/978-3-540-24592-6_3 fatcat:37sglg3xyvbtjgarntu5w7n33y