Documents All Rights Reserved © Alcatel-Lucent 2006, ##### Matthew Andrews Show-and-Tell April 20, 2010 Edge....

Edge Disjoint Paths (EDP) Input Graph G (M edges, N nodes); A set of demands, (si , ti); Output A subset of demands routed on edge-disjoint paths; Maximize such a subset…

Documents Edge Disjoint Paths (EDP)

Edge Disjoint Paths (EDP) Input Graph G (M edges, N nodes); A set of demands, (si , ti); Output A subset of demands routed on edge-disjoint paths; Maximize such a subset…