Browsing Combinatorics and Optimization by Subject "algorithm"
Now showing items 1-2 of 2
-
Approximation Algorithms for (S,T)-Connectivity Problems
(University of Waterloo, 2010-08-03)We study a directed network design problem called the $k$-$(S,T)$-connectivity problem; we design and analyze approximation algorithms and give hardness results. For each positive integer $k$, the minimum cost $k$-vertex ... -
Finding an induced path that is not a shortest path
(Elsevier, 2021-07)We give a polynomial-time algorithm that, with input a graph G and two vertices u; v of G, decides whether there is an induced uv-path that is longer than the shortest uv-path.