Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs