Randomized priority algorithms - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2010

Randomized priority algorithms

Spyros Angelopoulos
Allan Borodin
  • Fonction : Auteur

Résumé

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.

Dates et versions

hal-02986727 , version 1 (03-11-2020)

Identifiants

Citer

Spyros Angelopoulos, Allan Borodin. Randomized priority algorithms. Theoretical Computer Science, 2010, 411 (26-28), pp.2542-2558. ⟨10.1016/j.tcs.2010.03.014⟩. ⟨hal-02986727⟩
11 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More