A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Priority algorithms for graph optimization problems
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
doi:10.1016/j.tcs.2009.09.033
fatcat:ohz4f5jy65gsvapew2adzhcese