Hardness of Approximation for minimum path cover in an undirected graph? Posted by Bell, at cstheory.stackexchange.com, 08 Mar 2018 Given an undirected graph $G = (V,E)$, a path cover is a set of disjoint paths such that every vertex $v\in V$ belongs to…