Highly Influenced

@article{Wu1992PathmatchingP, title={Path-matching problems}, author={Sun Wu and Udi Manber}, journal={Algorithmica}, year={1992}, volume={8}, pages={89-101} }

- Published 1992 in Algorithmica
DOI:10.1007/BF01758837

The notion of matching in graphs is generalized in this paper to a set of paths rather than to a set of edges. The generalized problem, which we call thepath-matching problem, is to pair the vertices of an undirected weighted graph such that the paths connecting each pair are subject to certain objectives and/or constraints. This paper concentrates on the case where the paths are required to be edge-disjoint and the objective is to minimize the maximal cost of a path in the matching (i.e., the… CONTINUE READING

### Presentations referencing similar topics