A collection of landmarks is complete if the cost of a minimum-cost hitting set equals h+ and there is a minimum-cost hitting set that is an optimal relaxed plan. We present an algorithm for generatin
