We study the problem of computing the minimum vertex cover on k-uniform k-partite hypergraphs when the k-partition is given. On bipartite graphs (k=2), the minimum vertex cover can be computed in polynomial time. For k \ge 3, this problem is known to be NP-hard. For general k, the problem was ... more >>>