Randomized priority algorithms

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.

• Type: Journal
• Year: 2010
• Where: TCS
• Authors: Spyros Angelopoulos, Allan Borodin
• Keywords: Deterministic Greedy-like Algorithms, Greedy-like Algorithms, Priority Algorithms, TCS 2010, Theoretical Computer Science