Now showing items 1-1 of 1
Hardness results and approximation algorithms for some problems on graphs
(University of Waterloo, 2008-12-17)
This thesis has two parts. In the first part, we study some graph covering problems with a non-local covering rule that allows a "remote" node to be covered by repeatedly applying the covering rule. In the second part, we ...