We consider a new problem of designing network with small s - t effective resistance. In this problem, we are given an undirected graph G = (V,E) , two designated vertices s,t ∈ V and budget k . The goal is to choose subgraph at most edges minimize the This interpolation between shortest path minimum cost flow has applications in electrical design. present several algorithmic hardness results f...