Greedy in approximation algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Note: On exponential time lower bound of Knapsack under backtracking
Theoretical Computer Science
Randomized priority algorithms
Theoretical Computer Science
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Priority algorithms for the subset-sum problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
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 possible to derive non-trivial lower bounds on the approximability of the problems by algorithms in such a class. Our results are orthogonal to complexity considerations, and hence apply to algorithms that are not necessarily polynomial time.