Abstract Given two finite sets A and B of points in the Euclidean plane, a minimum multi-source multi-sink Steiner network or ( , )-network, is directed graph embedded plane with dipath from every node to such that total length all arcs minimised. Such may contain points—nodes appearing solution are neither nor . We show for any point there exists )-network constructible by straightedge compass...