This thesis aims at designing exact and approximation algorithms and showing NP-completeness results for variations and special cases of covering, hitting, and packing problems naturally arising in the field of computatio ...