Priority Algorithms for Graph Optimization Problems
We continue the study of priority or “greedy-like” algorithms as initiated in  and as extended to graph theoretic problems in . Graph theoretic problems pose some modelling problems that did not exist in the original applications of  and . Following , we further clarify these concepts. In the graph theoretic setting there are several natural input formulations for a given problem and we show that priority algorithm bounds in general depend on the input formulation. We study a variety of graph problems in the context of arbitrary and restricted priority models corresponding to known “greedy algorithms”.
KeywordsGreedy Algorithm Approximation Ratio Chromatic Number Vertex Cover Combinatorial Auction
Unable to display preview. Download preview PDF.
- 4.Berman, P., Fujito, T.: On approximation properties of the independent set problem for degree 3 graphs. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 449–460. Springer, Heidelberg (1995)Google Scholar
- 7.Borodin, A., Boyar, J., Larsen, K.S.: Priority algorithms for graph optimization problems. Preprint PP-2004-10, Department of Mathematics and Computer Science, University of Southern Denmark (2004)Google Scholar
- 9.Davis, S., Impagliazzo, R.: Models of greedy algorithms for graph problems. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (2004)Google Scholar
- 10.Dinur, I., Safra, S.: The importance of being biased. In: Proceedings of the 34th Symposium on Theory of Computing, pp. 33–42. ACM Press, New York (2002)Google Scholar
- 21.Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)Google Scholar