In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with $V$ nodes, a set of terminal pairs and an integer $c$. The objective is to route as many terminal pairs as possible, subject to the constraint that at most $c$ demands can be routed ... more >>>