Length-constrained path-matchings in graphs

Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni

Abstract: The path-matching problem is to find a set of vertex- or edge-disjoint paths with length constraints in a given graph with a given set of endpoints. This problem has several applications in broadcast...