We examine the possibility of approximating Maximum Vertex-Disjoint Shortest Paths. In this problem, the input is an edge-weighted (directed or undirected) n-vertex graph G along with k terminal pairs ( s 1 , t 1 ) , ( s 2 , t 2 ) , … , ( s k , t k ) ... ...

请注册登录后继续浏览