Before revision:  AHTP admits a trivial factor t approximation algorithm as it can be cast as an instance of vertex cover on a structured t-uniform hypergraph that is a ``blown-up'' version of H. Our main result is an approximation algorithm with ratio \frac{t simple %DIFAUXCMD hypergraph with hyperedges intersecting in at most one element .
After revision:  AHTP admits a trivial factor t approximation algorithm as it can be cast as an instance of vertex cover on a structured t-uniform hypergraph that is a ``blown-up'' version of H. Our main result is an approximation algorithm with ratio \frac{t %DIFAUXCMD hypergraph with hyperedges intersecting in at most one element .