We apply and extend the priority algorithm framework introduced by Borodin, Nielsen and
Rackoff to define “greedy-like” algorithms for (uncapacitated) facility location and set cover.
These problems have been the focus of extensive research from the point of view of
approximation algorithms, and for both problems greedy algorithms have been proposed
and analyzed. The priority algorithm definitions are general enough so as to capture a broad
class of algorithms that can be characterized as “greedy-like” while still possible to derive …

We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and
Rackoff to define “greedy-like” algorithms for the (uncapacitated) facility location problems
and set cover problems. These problems have been the focus of extensive research from the
point of view of approximation algorithms and for both problems greedy-like algorithms have
been proposed and analyzed. The priority algorithm definitions are general enough to
capture a broad class of algorithms that can be characterized as “greedy-like” while still …