Priority algorithms for graph optimization problems

Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi
2010 Theoretical Computer Science  
We continue the study of priority or "greedy-like" algorithms as initiated in [6] and as extended to graph theoretic problems in [8] . Graph theoretic problems pose some modelling problems that did not exist in the original applications of [6] and [2]. Following [8], 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
more » ... iety of graph problems in the context of arbitrary and restricted priority models corresponding to known "greedy algorithms".
doi:10.1016/j.tcs.2009.09.033 fatcat:ohz4f5jy65gsvapew2adzhcese