Matchings under distance constraints I

Péter Madarasi

This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots ,s_n\}$, a weight function on the edges and a…