Now showing items 1-1 of 1

    • Approximation Algorithms for (S,T)-Connectivity Problems 

      Laekhanukit, Bundit (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 ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages