New Hardness Results for Undirected Edge Disjoint Paths

@inproceedings{Chuzhoy2005NewHR,
  title={New Hardness Results for Undirected Edge Disjoint Paths},
  author={Julia Chuzhoy and Sanjeev Khanna},
  year={2005}
}
In the edge-disjoint paths (EDP) problem, we are given a graph G and a set of source-sink pairs in G. The goal is connect as many pairs as possible in an edge-disjoint manner. This problem is NP-hard and the best known approximation algorithm gives an Õ(min{n2/3,√m})-approximation for both directed and undirected graphs; here n and m denote the number of vertices and edges in G respectively. For directed graphs, this result is tight as a function of m since it is known that directed EDP is NP… CONTINUE READING

Similar Papers

Loading similar papers…