Abstract
Borodin, Nielsen and Rackoff [5] proposed a framework for abstracting the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] extended it so as to make it applicable to graph optimization problems. In this paper we propose a related model which places certain reasonable restrictions on the power of the greedy-like algorithm. Our goal is to define a model in which it is possible to filter out certain overly powerful algorithms, while still capturing a very rich class of greedy-like algorithms. We argue that this approach better motivates the lower-bound proofs and possibly yields better bounds. To illustrate the techniques involved we apply the model to the well-known problems of (complete) facility location and dominating set.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Angelopoulos, S.: Randomized priority algorithms. In: Proceedings of the 1st International Workshop on Approximation and Online Algorithms, pp. 27–40 (2003)
Angelopoulos, S., Borodin, A.: On the power of priority algorithms for facility location and set cover. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 26–39. Springer, Heidelberg (2002)
Bar-Yehuda, R., Moran, S.: On approximation problems related to the independent set and vertex cover problems. Disc. Appl. Math. 9, 1–10 (1984)
Borodin, A., Boyar, J., Larsen, K.S.: Priority algorithms for graph optimization problems. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 126–139. Springer, Heidelberg (2005)
Borodin, A., Nielsen, M., Rackoff, C.: (Incremental) priority algorithms. Algorithmica 37, 295–326 (2003)
Davis, S., Impagliazzo, R.: Models of greedy algorithms for graph problems. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (2004)
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634–652 (1998)
Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. In: Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 649–657 (1998)
Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computation, pp. 731–740 (2002)
Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM 48(2), 274–296 (2001)
Johnson, D.S.: Approximation algorithms for combinatorial problems. JCSS 9(3), 256–278 (1974)
Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: A greedy facility location algorithm analyzed using dual fitting. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 127–137. Springer, Heidelberg (2001)
Mahdian, M., Ye, J., Zhang, J.: Improved approximation algorithms for the partial vertex cover problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 161–242. Springer, Heidelberg (2002)
Mettu, R.R., Plaxton, C.G.: The online median problem. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 339–348 (2000)
Regev, O.: Priority algorithms for makespan minimization in the subset model. IPL 84(3), 153–157 (2002)
Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265–274 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelopoulos, S. (2005). Order-Preserving Transformations and Greedy-Like Algorithms. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31833-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-31833-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24574-2
Online ISBN: 978-3-540-31833-0
eBook Packages: Computer ScienceComputer Science (R0)