Abstract
Borodin et al. (Algorithmica 37(4):295–326, 2003) gave a model of greedy-like algorithms for scheduling problems and Angelopoulos and Borodin (Algorithmica 40(4):271–291, 2004) extended their work to facility location and set cover problems. We generalize their model to include other optimization problems, and apply the generalized framework to graph problems. Our goal is to define an abstract model that captures the intrinsic power and limitations of greedy algorithms for various graph optimization problems, as Borodin et al. (Algorithmica 37(4):295–326, 2003) did for scheduling. We prove bounds on the approximation ratio achievable by such algorithms for basic graph problems such as shortest path, weighted vertex cover, Steiner tree, and independent set. For example, we show that, for the shortest path problem, no algorithm in the FIXED priority model can achieve any approximation ratio (even one dependent on the graph size), but the well-known Dijkstra’s algorithm is an optimal ADAPTIVE priority algorithm. We also prove that the approximation ratio for weighted vertex cover achievable by ADAPTIVE priority algorithms is exactly 2. Here, a new lower bound matches the known upper bounds (Johnson in J. Comput. Syst. Sci. 9(3):256–278, 1974). We give a number of other lower bounds for priority algorithms, as well as a new approximation algorithm for minimum Steiner tree problem with weights in the interval [1,2].
Similar content being viewed by others
References
Alekhnovich, M., Borodin, A., Buresh-Oppenheim, J., Impagliazzo, R., Magen, A., Pitassi, T.: Toward a model for backtracking and dynamic programming. In: IEEE Conference on Computational Complexity, pp. 308–322, 2005
Angelopoulos, S.: Randomized priority algorithms: (extended abstract). In: WAOA, pp. 27–40, 2003
Angelopoulos, S.: Order-preserving transformations and greedy-like algorithms. In: WAOA, pp. 197–210, 2004
Angelopoulos, S., Borodin, A.: On the power of priority algorithms for facility location and set cover. Algorithmica 40(4), 271–291 (2004)
Arora, S., Bollobás, B., Lovász, L.: Proving integrality gaps without knowing the linear program. In: FOCS, pp. 313–322, 2002
Bern, M.W., Plassmann, P.E.: The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett. 32(4), 171–176 (1989)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Borodin, A., Nielsen, M.N., Rackoff, C.: (Incremental) priority algorithms. Algorithmica 37(4), 295–326 (2003)
Borodin, A., Boyar, J., Larsen, K.S.: Priority algorithms for graph optimization problems. In: WAOA, pp. 126–139, 2004
Borodin, A., Cashman, D., Magen, A.: How well can primal-dual and local-ratio algorithms perform? In: ICALP, pp. 943–955, 2005
Clementi, A.E.F., Trevisan, L.: Improved non-approximability results for minimum vertex cover with density constraints. Theor. Comput. Sci. 225(1–2), 113–128 (1999)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press/McGraw–Hill, Cambridge/New York (2001)
Dinur, I., Safra, S.: On the hardness of approximating minimum vertex-cover. Ann. Math. 162(1), 439–485 (2005)
Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput. 31(5), 1608–1623 (2002)
Halldórsson, M.M., Yoshihara, K.: Greedy approximations of independent sets in low degree graphs. In: ISAAC, pp. 152–161, December 1995
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256–278 (1974)
Kou, L.T., Markowsky, G., Berman, L.: A fast algorithm for steiner trees. Acta Inf. 15, 141–145 (1981)
Neapolitan, R.E., Naimipour, K.: Foundations of Algorithms. Bartlett (1997)
Papakonstantinou, P.A.: Hierarchies for classes of priority algorithms for job scheduling. Theor. Comput. Sci. 352(1-3), 181–189 (2006)
Plesnìk, J.: A bound for Steiner tree problem in graphs. Math. Slovaca 31, 155–163 (1981)
Rayward-Smith, V.J.: The computation of nearly minimal Steiner trees in graphs. Int. J. Math. Educ. Sci. Tech. 14, 15–23 (1983)
Robins, G., Zelikovsky, A.: Tighter bounds for graph steiner tree approximation. SIAM J. Discrete Math. 19(1), 122–134 (2005)
Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)
Waxman, B.M., Imase, M.: Worst-case performance of rayward-smith’s steiner tree heuristic. Inf. Process. Lett. 29(6), 283–287 (1988)
Author information
Authors and Affiliations
Corresponding author
Additional information
S. Davis’ research supported by NSF grants CCR-0098197, CCR-0313241, and CCR-0515332. Views expressed are not endorsed by the NSF.
R. Impagliazzo’s research supported by NSF grant CCR-0098197, CCR-0313241, and CCR-0515332. Views expressed are not endorsed by the NSF. Some work done while at the Institute for Advanced Study, supported by the State of New Jersey.
Rights and permissions
About this article
Cite this article
Davis, S., Impagliazzo, R. Models of Greedy Algorithms for Graph Problems. Algorithmica 54, 269–317 (2009). https://doi.org/10.1007/s00453-007-9124-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-007-9124-4