Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A tight analysis of the greedy algorithm for set cover
Journal of Algorithms
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for facility location problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Models of greedy algorithms for graph problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
BubbleSearch: a simple heuristic for improving priority-based greedy algorithms
Information Processing Letters
Hierarchies for classes of priority algorithms for job scheduling
Theoretical Computer Science
Priority algorithms for graph optimization problems
Theoretical Computer Science
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
Information Processing Letters
Priority algorithms for graph optimization problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Order-preserving transformations and greedy-like algorithms
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
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 non-trivial lower bounds on the approximability of the problems. Our results are orthogonal to complexity considerations, and hence apply to algorithms that are not necessarily polynomial-time.